#include <bits/stdc++.h>
using namespace std;
const int modul = 1000000007;
const int nmax = 100100;
const double e = 1e-8;
const double pi = acos(-1);
int n, m, stest, c[nmax], F[nmax][2], G[nmax];
vector<int> head[nmax];
void DFS(int u) {
  F[u][0] = (c[u] == 0);
  for (int i = 0; i <= (int)head[u].size() - 1; i++) {
    int v = head[u][i];
    DFS(v);
    F[u][0] = ((long long)F[u][0] * (F[v][0] + F[v][1])) % modul;
  }
  G[(int)head[u].size()] = 1;
  for (int i = (int)head[u].size() - 1; i >= 0; i--) {
    int v = head[u][i];
    G[i] = ((long long)G[i + 1] * (F[v][0] + F[v][1])) % modul;
  }
  F[u][1] = (c[u] == 1);
  int cur = 1;
  for (int i = 0; i <= (int)head[u].size() - 1; i++) {
    int v = head[u][i];
    if (c[u] == 1) {
      F[u][1] = ((long long)F[u][1] * (F[v][0] + F[v][1])) % modul;
    } else {
      F[u][1] =
          (F[u][1] + (((long long)cur * G[i + 1]) % modul) * F[v][1]) % modul;
      cur = ((long long)cur * (F[v][0] + F[v][1])) % modul;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    int j;
    cin >> j;
    head[j].push_back(i);
  }
  for (int i = 0; i <= n - 1; i++) cin >> c[i];
  DFS(0);
  cout << F[0][1];
  return 0;
}
