#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define int long long
#define x first
#define y second
#define ps push_back
#define endl '\n'

#define kd                     \
  ios::sync_with_stdio(false); \
  cin.tie(0);                  \
  cout.tie(0);
using namespace std;
typedef pair<int, int> pi;
const int N = 2e6 + 100, mod = 1e9 + 7, INF = 1e10;
int lowbit(int x) { return x & -x; }
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }

int last[N], w[N];
int vis[N], cnt, sum;
vector<int> v[N];
int ans[N];
void add(int x, int y) { v[x].ps(y); }

void dfs(int u, int pr) {
  int temp;
  if (!vis[w[u]]) {
    temp = cnt;
    cnt++;
  } else if (vis[w[u]] == 1) {
    temp = cnt - last[w[u]] + 1;
  } else {
    temp = cnt - last[w[u]];
  }
  vis[w[u]]++;
  ans[u] = sum + temp;

  int fa = last[w[u]];
  sum += temp;
  last[w[u]] = cnt;
  // cout << u << " " << last[w[u]] << endl;
  for (int j : v[u]) {
    dfs(j, u);
  }
  last[w[u]] = fa;
  vis[w[u]]--;
  sum -= temp;
  if (!vis[w[u]]) cnt--;
}

void solve() {
  int n;
  while (cin >> n) {
    sum = 0, cnt = 0;
    for (int i = 1; i <= n; i++)
      v[i].clear(), last[i] = 0, vis[i] = 0, ans[i] = 0;
    for (int i = 2; i <= n; i++) {
      int x;
      cin >> x;
      add(x, i);
    }
    for (int i = 1; i <= n; i++) cin >> w[i];
    dfs(1, -1);
    for (int i = 2; i <= n; i++) {
      cout << ans[i] << endl;
    }
    // cout << endl;
  }
}

signed main() {
  kd;
  int _;
  _ = 1;
  // cin>>_;
  while (_--) solve();
  return 0;
}