#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007, M = 1e5 + 7;
long long powe(long long x, long long y) {
  x = x % mod;
  long long ans = 1;
  while (y > 0) {
    if (y & 1) {
      ans = (1ll * x * ans) % mod;
    }
    y >>= 1;
    x = (1ll * x * x) % mod;
  }
  return ans;
}
vector<int> edg[M];
bool col[M], vis[M];
long long s0[M], s1[M];
void dfs(int i) {
  vis[i] = true;
  if (col[i])
    s1[i] = 1;
  else
    s0[i] = 1;
  for (auto x : edg[i]) {
    if (vis[x]) continue;
    dfs(x);
    s1[i] = (((s1[i] * s0[x])) % mod + (s0[i] * s1[x]) % mod +
             (s1[i] * s1[x]) % mod) %
            mod;
    s0[i] = ((s0[i] * s0[x]) % mod + (s0[i] * s1[x]) % mod) % mod;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, a;
  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> a;
    edg[i].push_back(a);
    edg[a].push_back(i);
  }
  for (int i = 0; i < n; i++) cin >> col[i];
  dfs(0);
  cout << s1[0];
  return 0;
}
