#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007, MaxN = 100001;
long long int f[MaxN], g[MaxN], C[MaxN], A, B;
vector<int> ady[MaxN];
long long int mcd(long long int a, long long int b) {
  if (!b) {
    A = 1, B = 0;
    return a;
  }
  long long int gcd = mcd(b, a % b), x, y;
  x = A, y = B;
  A = y, B = x - y * (a / b);
  return gcd;
}
long long int inverse(long long int a) {
  mcd(a, MOD);
  return (A + MOD * 5) % MOD;
}
void DFS(int x, int past) {
  long long int s = 1, i, j, p, q, T = 1;
  for (i = 0; i < ady[x].size(); i++) {
    if (ady[x][i] == past) continue;
    p = ady[x][i], DFS(p, x);
    T = (T * (g[p] + f[p]) % MOD) % MOD;
  }
  if (C[x]) {
    f[x] = T;
    g[x] = 0;
  } else {
    for (i = 0; i < ady[x].size(); i++) {
      if (ady[x][i] == past) continue;
      p = ady[x][i];
      f[x] = (f[x] + ((T * f[p]) % MOD) * inverse((f[p] + g[p]) % MOD)) % MOD;
    }
    g[x] = T;
  }
}
int main() {
  long long int i, j, p, q, N;
  cin >> N;
  for (i = 1; i < N; i++) {
    cin >> p;
    ady[p].push_back(i);
    ady[i].push_back(p);
  }
  for (i = 0; i < N; i++) cin >> C[i];
  DFS(0, 0);
  cout << f[0] << "\n";
}
