#include <bits/stdc++.h>
using namespace std;
vector<long long> G[100010], ter;
long long n, root, c[100010], par[100010], dt[100010][2], ans;
void dfs(int v, int pv) {
  dt[v][0] = 1;
  dt[v][1] = 0;
  for (int w : G[v])
    if (w != pv) {
      dfs(w, v);
      dt[v][1] *= dt[w][0];
      dt[v][1] += dt[v][0] * dt[w][1];
      dt[v][0] *= dt[w][0];
      dt[v][1] %= 1000000007, dt[v][0] %= 1000000007;
    }
  if (c[v] == 1)
    dt[v][1] = dt[v][0];
  else
    dt[v][0] += dt[v][1];
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 1, t; i < n; i++) {
    cin >> t;
    G[i].push_back(t), G[t].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> c[i];
  dfs(0, 0);
  cout << dt[0][1] << endl;
  return 0;
}
