#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void ckmax(T& x, T y) {
  x = (y > x ? y : x);
}
template <typename T>
inline void ckmin(T& x, T y) {
  x = (y < x ? y : x);
}
namespace Fread {
const int SIZE = 1 << 21;
char buf[SIZE], *S, *T;
inline char getchar() {
  if (S == T) {
    T = (S = buf) + fread(buf, 1, SIZE, stdin);
    if (S == T) return '\n';
  }
  return *S++;
}
}  // namespace Fread
namespace Fwrite {
const int SIZE = 1 << 21;
char buf[SIZE], *S = buf, *T = buf + SIZE;
inline void flush() {
  fwrite(buf, 1, S - buf, stdout);
  S = buf;
}
inline void putchar(char c) {
  *S++ = c;
  if (S == T) flush();
}
struct NTR {
  ~NTR() { flush(); }
} ztr;
}  // namespace Fwrite
namespace Fastio {
struct Reader {
  template <typename T>
  Reader& operator>>(T& x) {
    char c = Fread ::getchar();
    T f = 1;
    while (c < '0' || c > '9') {
      if (c == '-') f = -1;
      c = Fread ::getchar();
    }
    x = 0;
    while (c >= '0' && c <= '9') {
      x = x * 10 + (c - '0');
      c = Fread ::getchar();
    }
    x *= f;
    return *this;
  }
  Reader& operator>>(char& c) {
    c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    return *this;
  }
  Reader& operator>>(char* str) {
    int len = 0;
    char c = Fread ::getchar();
    while (c == '\n' || c == ' ') c = Fread ::getchar();
    while (c != '\n' && c != ' ') {
      str[len++] = c;
      c = Fread ::getchar();
    }
    str[len] = '\0';
    return *this;
  }
  Reader() {}
} cin;
const char endl = '\n';
struct Writer {
  template <typename T>
  Writer& operator<<(T x) {
    if (x == 0) {
      Fwrite ::putchar('0');
      return *this;
    }
    if (x < 0) {
      Fwrite ::putchar('-');
      x = -x;
    }
    static int sta[45];
    int top = 0;
    while (x) {
      sta[++top] = x % 10;
      x /= 10;
    }
    while (top) {
      Fwrite ::putchar(sta[top] + '0');
      --top;
    }
    return *this;
  }
  Writer& operator<<(char c) {
    Fwrite ::putchar(c);
    return *this;
  }
  Writer& operator<<(char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer& operator<<(const char* str) {
    int cur = 0;
    while (str[cur]) Fwrite ::putchar(str[cur++]);
    return *this;
  }
  Writer() {}
} cout;
}  // namespace Fastio
const int MAXN = 1e6;
const int MOD = 1e9 + 7;
int n, a[MAXN + 5], fa[MAXN + 5];
long long s[MAXN + 5], S;
int f[MAXN + 5], dp[MAXN + 5];
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
int main() {
  Fastio ::cin >> n;
  for (int i = 1; i <= n; ++i) {
    Fastio ::cin >> a[i];
    s[i] = a[i];
    S += a[i];
  }
  for (int i = 2; i <= n; ++i) {
    Fastio ::cin >> fa[i];
  }
  for (int i = n; i >= 2; --i) {
    s[fa[i]] += s[i];
  }
  assert(s[1] == S);
  for (int i = 1; i <= n; ++i) {
    long long v = S / gcd(S, s[i]);
    if (v <= n) {
      f[v]++;
    }
  }
  for (int i = n; i >= 1; --i) {
    for (int j = i + i; j <= n; j += i) {
      f[j] += f[i];
    }
  }
  for (int i = 1; i <= n; ++i) {
    f[i] = (f[i] == i);
  }
  dp[1] = 1;
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (!f[i]) {
      dp[i] = 0;
      continue;
    }
    for (int j = i + i; j <= n; j += i) {
      dp[j] = (dp[j] + dp[i]) % MOD;
    }
    ans = (ans + dp[i]) % MOD;
  }
  Fastio ::cout << ans << Fastio ::endl;
  return 0;
}
