#include <bits/stdc++.h>
using namespace std;
const int oo = 2000000009;
const double eps = 1e-9;
list<int> adj[100005];
int label[100005];
long long dp[100005][2];
const long long MOD = 1000000007;
void numWays(int v, int p) {
  dp[v][0] = 1 - label[v];
  dp[v][1] = label[v];
  for (typeof(adj[v].begin()) u = adj[v].begin(); u != adj[v].end(); u++)
    if (*u != p) {
      long long cum[2];
      numWays(*u, v);
      cum[0] = dp[v][0];
      cum[1] = dp[v][1];
      dp[v][0] = dp[v][1] = 0;
      dp[v][1] += dp[*u][0] * cum[1];
      dp[v][1] %= MOD;
      dp[v][1] += dp[*u][1] * cum[0];
      dp[v][1] %= MOD;
      dp[v][0] += dp[*u][0] * cum[0];
      dp[v][0] %= MOD;
      dp[v][1] += dp[*u][1] * cum[1];
      dp[v][1] %= MOD;
      dp[v][0] += dp[*u][1] * cum[0];
      dp[v][0] %= MOD;
    }
}
int main() {
  int n, temp;
  scanf("%d", &n);
  for (int i = 0; i < (n - 1); ++i) {
    scanf("%d", &temp);
    adj[i + 1].push_back(temp);
    adj[temp].push_back(i + 1);
  }
  for (int i = 0; i < (n); ++i) {
    scanf("%d", &label[i]);
  }
  numWays(0, -1);
  cout << dp[0][1] << endl;
  return 0;
}
