#include <bits/stdc++.h>
using namespace std;
const long long nax = 100005, mod = 1e9 + 7;
vector<long long> g[nax];
long long c[nax], dp[nax][2] = {{0}};
long long mod_expo(long long a, long long b) {
  long long tans = 1;
  a = a % mod;
  while (b != 0) {
    if (b & 1) tans = (1LL * tans * a) % mod;
    a = (1LL * a * a) % mod;
    b /= 2;
  }
  return tans;
}
long long mod_inv(long long a) { return mod_expo(a, mod - 2); }
long long sum(long long a, long long b) { return (a + b) % mod; }
long long mul(long long a, long long b) { return (a * b) % mod; }
long long divm(long long a, long long b) { return (a * mod_inv(b)) % mod; }
void dfs(long long u, long long p) {
  for (auto &k : g[u])
    if (k != p) dfs(k, u);
  if (c[u] == 0) {
    dp[u][0] = 1;
    for (auto &k : g[u])
      if (k != p) dp[u][0] = (dp[u][0] * (dp[k][0] + dp[k][1])) % mod;
    dp[u][1] = 0;
    long long zpi = 1;
    for (auto &k : g[u])
      if (k != p) zpi = (zpi * (dp[k][0] + dp[k][1])) % mod;
    for (auto &k : g[u])
      if (k != p)
        dp[u][1] =
            sum(dp[u][1], mul(divm(zpi, (dp[k][0] + dp[k][1])), dp[k][1]));
  } else {
    dp[u][0] = 0;
    dp[u][1] = 1;
    for (auto &k : g[u])
      if (k != p) dp[u][1] = (dp[u][1] * (dp[k][0] + dp[k][1])) % mod;
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long x;
    cin >> x;
    g[i + 1].push_back(x);
    g[x].push_back(i + 1);
  }
  for (long long i = 0; i < n; i++) cin >> c[i];
  dfs(0, 0);
  cout << dp[0][1] << endl;
}
