#include <bits/stdc++.h>
using namespace std;
const int maxn = 111111;
const int maxm = 111111;
const int mod = 1000000007;
int n;
vector<int> a[maxn];
int col[maxn];
int s[maxn];
int num;
int v[maxn];
long long dp[maxn][2];
void dfs(int x) {
  v[x] = 1;
  int len = a[x].size();
  for (int i = 0; i < len; i++)
    if (!v[a[x][i]]) {
      dfs(a[x][i]);
    }
  s[num++] = x;
}
void solve() {
  num = 0;
  int t;
  memset(v, 0, sizeof(v));
  for (int i = 0; i <= n; i++) {
    a[i].clear();
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d", &t);
    a[i + 1].push_back(t);
    a[t].push_back(i + 1);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &col[i]);
  }
  dfs(0);
  int len;
  memset(v, 0, sizeof(v));
  for (int i = 0; i < num; i++) {
    t = s[i];
    v[t] = 1;
    if (col[t] == 1) {
      dp[t][0] = 0;
      dp[t][1] = 1;
      len = a[t].size();
      for (int i = 0; i < len; i++)
        if (v[a[t][i]]) {
          dp[t][1] = dp[t][1] * (dp[a[t][i]][1] + dp[a[t][i]][0]) % mod;
        }
    } else {
      dp[t][0] = 1;
      dp[t][1] = 0;
      len = a[t].size();
      for (int i = 0; i < len; i++)
        if (v[a[t][i]]) {
          dp[t][1] = (dp[t][1] * (dp[a[t][i]][1] + dp[a[t][i]][0]) +
                      dp[t][0] * dp[a[t][i]][1]) %
                     mod;
          dp[t][0] = dp[t][0] * (dp[a[t][i]][1] + dp[a[t][i]][0]) % mod;
        }
    }
  }
  cout << dp[0][1] << endl;
}
int main() {
  int t;
  while (~scanf("%d", &n)) {
    solve();
  }
  return 0;
}
