#include <bits/stdc++.h>
using namespace std;
const int Max = 100005;
const long long mod = 1e9 + 7;
vector<int> edge[Max];
int is[Max];
long long dp[Max][2];
long long inv(long long x) {
  long long res = 1;
  for (int k = mod - 2; k; k >>= 1) {
    if (k & 1) res = res * x % mod;
    x = x * x % mod;
  }
  return res;
}
void dfs(int u, int f) {
  int v, m = edge[u].size();
  long long tot = 1;
  long long tmp;
  for (int i = 0; i < m; i++) {
    v = edge[u][i];
    if (v == f) continue;
    dfs(v, u);
    tot = tot * (dp[v][0] + dp[v][1]) % mod;
  }
  if (is[u])
    dp[u][0] = 0;
  else
    dp[u][0] = tot;
  if (is[u])
    dp[u][1] = tot;
  else {
    dp[u][1] = 0;
    for (int i = 0; i < m; i++) {
      v = edge[u][i];
      if (v == f) continue;
      tmp = (tot * dp[v][1] % mod) * inv(dp[v][0] + dp[v][1]) % mod;
      dp[u][1] = (dp[u][1] + tmp) % mod;
    }
  }
}
int main() {
  int n, p;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d", &p);
    edge[i].push_back(p);
    edge[p].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &is[i]);
  }
  dfs(0, -1);
  cout << dp[0][1] << endl;
  return 0;
}
