#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
struct Edge {
  int v;
  Edge *next;
};
int n, p[100000], x[100000], f[100000], g[100000];
vector<int> ed[100000];
int ExEuler(int a, int b, int c) {
  c = c < 0 ? c + (-(c + 1) / b + 1) * b : c % b;
  return a ? ((long long)ExEuler(b % a, a, -c) * b + c) / a : 0;
}
int Div(int a, int b) { return ExEuler(b, mod, a); }
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) scanf("%d", &p[i]), ed[p[i]].push_back(i);
  for (int i = 0; i < n; i++) scanf("%d", &x[i]);
  for (int i = n - 1; i >= 0; i--) {
    if (x[i]) {
      f[i] = 1;
      for (int j = 0; j < ed[i].size(); j++)
        f[i] = (long long)f[i] * (g[ed[i][j]] + f[ed[i][j]]) % mod;
    } else {
      g[i] = 1;
      for (int j = 0; j < ed[i].size(); j++)
        g[i] = (long long)g[i] * (g[ed[i][j]] + f[ed[i][j]]) % mod;
      for (int j = 0; j < ed[i].size(); j++)
        f[i] = ((long long)Div(g[i], g[ed[i][j]] + f[ed[i][j]]) * f[ed[i][j]] +
                f[i]) %
               mod;
    }
  }
  printf("%d\n", f[0]);
  getchar();
  getchar();
  return 0;
}
