#include <bits/stdc++.h>
using namespace std;
long long p(long long x, long long n) {
  x %= 1000000007ll;
  long long ret = 1;
  while (n > 0) {
    if (n & (1ll)) ret = ret * x % 1000000007ll;
    x = x * x % 1000000007ll;
    n >>= (1ll);
  }
  return ret;
}
int n;
vector<int> node[233333];
int x[233333];
long long dp[233333][3];
void dfs(int u, int fa) {
  int cnt = 0;
  for (int i = 0; i < node[u].size(); i++) {
    if (node[u][i] != fa) dfs(node[u][i], u), cnt++;
  }
  if (cnt == 0) {
    if (x[u] == 0) {
      dp[u][0] = 0;
      dp[u][1] = 1;
      dp[u][2] = 0;
    } else {
      dp[u][0] = 1;
      dp[u][1] = 0;
      dp[u][2] = 1;
    }
    return;
  }
  if (x[u] == 1) {
    dp[u][0] = 1;
    dp[u][1] = 0;
    for (int i = 0; i < node[u].size(); i++) {
      int v = node[u][i];
      if (v == fa) continue;
      dp[u][0] =
          (dp[u][0] * ((dp[v][1] + dp[v][2]) % 1000000007ll)) % 1000000007ll;
    }
    dp[u][2] = dp[u][0];
  } else {
    dp[u][1] = 1;
    dp[u][0] = 0;
    for (int i = 0; i < node[u].size(); i++) {
      int v = node[u][i];
      if (v == fa) continue;
      dp[u][0] = dp[u][0] * (dp[v][1] + dp[v][2]) % 1000000007ll +
                 dp[u][1] * dp[v][0] % 1000000007ll;
      dp[u][0] %= 1000000007ll;
      dp[u][1] = dp[u][1] * (dp[v][1] + dp[v][2]) % 1000000007ll;
    }
    dp[u][2] = dp[u][0];
  }
}
int Main() {
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int p;
    cin >> p;
    node[i + 2].push_back(p + 1);
    node[p + 1].push_back(i + 2);
  }
  for (int i = 1; i <= n; i++) {
    cin >> x[i];
  }
  dfs(1, -1);
  cout << dp[1][2] << endl;
  return 0;
}
int main() { return Main(); }
