#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e5;
vector<int> g[N];
int dp[N][2], col[N], l[N], r[N];
void dfs(int v) {
  int sz = g[v].size();
  for (int i = 0; i < sz; i++) dfs(g[v][i]);
  if (col[v]) {
    int add = 1;
    for (int i = 0; i < sz; i++)
      add = (add * 1ll * (dp[g[v][i]][0] + dp[g[v][i]][1])) % MOD;
    dp[v][1] = (dp[v][1] + add) % MOD;
  } else {
    int add = 1;
    for (int i = 0; i < sz; i++)
      add = (add * 1ll * (dp[g[v][i]][0] + dp[g[v][i]][1])) % MOD;
    dp[v][0] = (dp[v][0] + add) % MOD;
    if (sz) {
      l[0] = (dp[g[v][0]][0] + dp[g[v][0]][1]) % MOD;
      r[sz - 1] = (dp[g[v][sz - 1]][0] + dp[g[v][sz - 1]][1]) % MOD;
    }
    for (int i = 1; i < sz; i++)
      l[i] = (l[i - 1] * 1ll * (dp[g[v][i]][0] + dp[g[v][i]][1])) % MOD;
    for (int i = sz - 2; i >= 0; i--)
      r[i] = (r[i + 1] * 1ll * (dp[g[v][i]][0] + dp[g[v][i]][1])) % MOD;
    for (int i = 0; i < sz; i++) {
      add = 1;
      add =
          (add * 1ll * (i ? l[i - 1] : 1) * (i != sz - 1 ? r[i + 1] : 1)) % MOD;
      add = (add * 1ll * dp[g[v][i]][1]) % MOD;
      dp[v][1] = (dp[v][1] + add) % MOD;
    }
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int p;
    cin >> p;
    g[p].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> col[i];
  dfs(0);
  cout << dp[0][1] << endl;
  return 0;
}
