#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> graph[100010];
long long dp0[100010], dp1[100010];
int color[100010];
int main(void) {
  int i, j;
  cin >> N;
  for ((i) = 0; (i) < (int)(N - 1); (i)++) {
    int p;
    scanf("%d", &p);
    graph[p].push_back(i + 1);
  }
  for ((i) = 0; (i) < (int)(N); (i)++) scanf("%d", &color[i]);
  for (i = N - 1; i >= 0; i--) {
    long long zero = 0, one = 0;
    if (color[i] == 0)
      zero++;
    else
      one++;
    for ((j) = 0; (j) < (int)(graph[i].size()); (j)++) {
      int v = graph[i][j];
      long long zero2 = (zero * dp1[v] + zero * dp0[v]) % 1000000007ll;
      long long one2 =
          (one * dp1[v] + zero * dp1[v] + one * dp0[v]) % 1000000007ll;
      zero = zero2;
      one = one2;
    }
    dp0[i] = zero;
    dp1[i] = one;
  }
  cout << dp1[0] << endl;
}
