#include <bits/stdc++.h>
#define db double
#define il inline
#define re register
#define ll long long
#define ui unsigned
#define ull ui ll
#define i128 __int128
#define pii pair<int, int>
#define fi first
#define se second
#define eb emplace_back
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(), v.end()
#define mems(v, x) memset(v, x, sizeof(v))
#define memc(a, b) memcpy(a, b, sizeof(a))
#define FOR(i, L, R) for(re int i = (L); i <= (R); ++i)
#define ROF(i, R, L) for(re int i = (R); i >= (L); --i)
#define LS i << 1, l, mid
#define RS i << 1 | 1, mid + 1, r
#define popc(x) __builtin_popcount(x)
using namespace std;
#define N 100005
#define P 1000000007
il int add(int x, int y) {return x + y < P ? x + y : x + y - P;}
il void addr(int &x, int y) {(x += y) >= P && (x -= P);}
il int qpow(int p, int n = P - 2) {
  int s = 1;
  while(n) {
    if(n & 1) s = 1ll * s * p % P;
    p = 1ll * p * p % P, n >>= 1;
  }
  return s;
}
int n, a[N]; vector<int> e[N];
ll ans[N]; int v[N], pre[N], s[N], mu[N];
il void upd(int x, int v) {while(x <= n) s[x] += v, x += x & -x;}
il int query(int x) {int v = 0; while(x) v += s[x], x ^= x & -x; return v;}
il int query(int l, int r) {return query(r) - query(l - 1);}
il void dfs(int x, int d = 1) {
  int s = pre[a[x]]; pre[a[x]] = d;
  ans[x] = query(s + 1, d); int p = mu[a[x]];
  if(s > 0) ans[x] += !mu[a[x]], mu[a[x]] = 1;
  if(!v[a[x]]++) upd(d, 1);
  for(auto y : e[x]) dfs(y, d + 1);
  if(!--v[a[x]]) upd(d, -1);
  pre[a[x]] = s, mu[a[x]] = p;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  while(cin >> n) {
    FOR(x, 1, n) vector<int>().swap(e[x]);
    FOR(x, 2, n) {int f; cin >> f, e[f].eb(x);}
    FOR(x, 1, n) cin >> a[x]; dfs(1);
    FOR(x, 1, n) for(auto y : e[x]) ans[y] += ans[x];
    FOR(x, 2, n) cout << ans[x] << "\n";
  }
  cerr << 1.0 * clock() / CLOCKS_PER_SEC;
  return 0;
}