#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
inline void solve(), read();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  read();
  solve();
  return 0;
}
long long n;
vector<long long> a, par, sum, k, dp, f;
const long long R = 1e9 + 7;
inline long long gcd(long long a, long long b) {
  while (b != 0) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline void solve() {
  sum = a;
  for (long long i = n - 1; i >= 1; i--) {
    sum[par[i]] += sum[i];
  }
  long long S = sum[0];
  k.resize(n);
  for (long long i = 0; i < n; i++) {
    k[i] = S / gcd(S, sum[i]);
  }
  dp.resize(n + 1);
  for (long long i = 0; i < n; i++) {
    if (k[i] <= n) {
      ++dp[k[i]];
    }
  }
  for (long long i = n; i >= 1; i--) {
    for (long long j = 2 * i; j <= n; j += i) {
      dp[j] += dp[i];
    }
  }
  f.resize(n + 1);
  long long ans = 0;
  f[1] = 1;
  for (long long i = 1; i <= n; i++) {
    if (dp[i] == i) {
      ans += f[i];
      ans %= R;
      for (long long j = 2 * i; j <= n; j += i) {
        f[j] += f[i];
        f[j] %= R;
      }
    }
  }
  cout << ans << "\n";
}
inline void read() {
  cin >> n;
  a.resize(n), par.resize(n, -1);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (long long i = 1; i < n; i++) {
    cin >> par[i];
    --par[i];
  }
}
