#include <bits/stdc++.h>
using namespace std;
int n, p[100010], x[100010];
vector<int> ch[100010];
long long a[2][100010];
long long modpow(long long q, long long w) {
  long long res = 1;
  q %= 1000000007;
  while (w) {
    if (w & 1) res = res * q % 1000000007;
    q = q * q % 1000000007;
    w >>= 1;
  }
  return res;
}
void dfs(int u) {
  a[0][u] = 1;
  for (int i = 0; i < ch[u].size(); i++) {
    int v = ch[u][i];
    dfs(v);
    a[0][u] *= a[0][v] + a[1][v];
    a[0][u] %= 1000000007;
  }
  if (x[u]) {
    a[1][u] = a[0][u];
    a[0][u] = 0;
    return;
  }
  for (int i = 0; i < ch[u].size(); i++) {
    int v = ch[u][i];
    long long b =
        a[0][u] * modpow(a[0][v] + a[1][v], 1000000007 - 2) % 1000000007;
    b = b * a[1][v] % 1000000007;
    a[1][u] += b;
    a[1][u] %= 1000000007;
  }
}
int main() {
  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> p[i];
    ch[p[i]].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> x[i];
  dfs(0);
  cout << a[1][0] << '\n';
}
