#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, mod = 1e9 + 7;
int head[N], nxt[N << 1], to[N << 1], cnt;
int n, col[N];
long long dp[N][2];
void init() {
  memset(head, -1, sizeof(head));
  cnt = 0;
}
void addEdge(int u, int v) {
  nxt[cnt] = head[u];
  to[cnt] = v;
  head[u] = cnt++;
}
void dfs(int u, int pre) {
  dp[u][0] = 1;
  dp[u][1] = 0;
  for (int i = head[u]; ~i; i = nxt[i]) {
    int v = to[i];
    if (v == pre) continue;
    dfs(v, u);
    dp[u][1] = dp[u][1] * dp[v][0] % mod;
    dp[u][1] = (dp[u][1] + dp[u][0] * dp[v][1]) % mod;
    dp[u][0] = dp[u][0] * dp[v][0] % mod;
  }
  if (col[u])
    dp[u][1] = dp[u][0];
  else
    dp[u][0] = (dp[u][0] + dp[u][1]) % mod;
}
int main() {
  while (~scanf("%d", &n)) {
    init();
    for (int i = 0, j; i < n - 1; i++) {
      scanf("%d", &j);
      addEdge(j, i + 1);
      addEdge(i + 1, j);
    }
    for (int i = 0; i < n; i++) scanf("%d", col + i);
    dfs(0, -1);
    printf("%I64d\n", dp[0][1]);
  }
  return 0;
}
