#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:33554432")
const int MOD = 1e9 + 7;
int N, K, A[100005], par[100005];
int D[100005][2];
vector<int> con[100005];
int inv(int n) {
  int ret = 1, v = n;
  for (int i = 0; i < 30; i++, v = (long long)v * v % MOD)
    if (((MOD - 2) >> i) & 1) {
      ret = (long long)ret * v % MOD;
    }
  return ret;
}
void dfs(int n) {
  int i, k;
  D[n][0] = 1;
  for (i = ((int)(con[n]).size()); i--;) {
    k = con[n][i];
    dfs(k);
    D[n][0] = (long long)D[n][0] * D[k][0] % MOD;
  }
  if (A[n])
    D[n][1] = D[n][0];
  else {
    for (i = ((int)(con[n]).size()); i--;) {
      k = con[n][i];
      int d = (long long)D[n][0] * inv(D[k][0]) % MOD;
      D[n][1] = (D[n][1] + (long long)D[k][1] * d % MOD) % MOD;
    }
    D[n][0] = (D[n][0] + (D[n][1])) % (MOD);
  }
}
int main() {
  int i, j, k;
  scanf("%d", &N);
  for (i = 2; i <= N; i++)
    scanf("%d", par + i), ++par[i], con[par[i]].push_back(i);
  for (i = 1; i <= N; i++) scanf("%d", A + i), K += A[i];
  dfs(1);
  printf("%d\n", D[1][1]);
}
