#include <bits/stdc++.h>
using namespace std;
const int MaxN = 1000005;
const double eps = 1e-8;
const double DINF = 1e100;
const int INF = 1000000006;
const long long LINF = 1000000000000000005ll;
const int mod = (int)1e9 + 7;
int n;
int color[MaxN];
vector<int> edges[MaxN];
long long f[MaxN][2];
long long tmp[MaxN][2];
bool vis[MaxN];
void dfs(int u) {
  vector<int> sons;
  for (auto v : edges[u]) {
    if (vis[v]) continue;
    vis[v] = 1;
    dfs(v);
    sons.push_back(v);
  }
  for (int i = 0; i <= sons.size(); ++i) tmp[i][0] = tmp[i][1] = 0;
  if (color[u] == 1)
    tmp[0][1] = 1;
  else
    tmp[0][0] = 1;
  for (int i = 0; i < sons.size(); ++i) {
    int v = sons[i];
    tmp[i + 1][1] = (tmp[i + 1][1] + tmp[i][0] * f[v][1] % mod) % mod;
    tmp[i + 1][1] =
        (tmp[i + 1][1] + tmp[i][1] * (f[v][0] + f[v][1]) % mod) % mod;
    tmp[i + 1][0] =
        (tmp[i + 1][0] + tmp[i][0] * (f[v][0] + f[v][1]) % mod) % mod;
  }
  f[u][0] = tmp[sons.size()][0];
  f[u][1] = tmp[sons.size()][1];
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    int x;
    scanf("%d", &x);
    edges[x].push_back(i);
    edges[i].push_back(x);
  }
  for (int i = 0; i < n; ++i) scanf("%d", color + i);
  vis[0] = 1;
  dfs(0);
  printf("%d\n", (int)f[0][1]);
  return 0;
}
