#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 55;
vector<int> vec[N];
int m = 1e9 + 7;
long long dp1[N];
long long dp2[N];
int a[N];
void dfs(int u, int parent) {
  dp1[u] = 1;
  dp2[u] = 0;
  for (auto v : vec[u]) {
    if (v == parent) continue;
    dfs(v, u);
    dp2[u] *= dp1[v];
    dp2[u] += dp1[u] * dp2[v];
    dp1[u] *= dp1[v];
    dp1[u] %= m;
    dp2[u] %= m;
  }
  if (a[u] == 1)
    dp2[u] = dp1[u];
  else
    dp1[u] += dp2[u];
  dp1[u] %= m;
  dp2[u] %= m;
}
int main() {
  ios::sync_with_stdio(0);
  int n;
  cin >> n;
  int x;
  for (int i = 1; i < n; i++) {
    cin >> x;
    vec[i].push_back(x);
    vec[x].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> a[i];
  dfs(0, 0);
  cout << dp2[0] % m << endl;
  return 0;
}
