#include <bits/stdc++.h>

using i64 = long long;

int n;
std::vector <int> a(100005), c(100005), p(100005);
std::vector <i64> f(100005);
std::vector <int> s[100005];

void dfs(int u) {
    static int C;
    static i64 D;
    c[u] = C;

    int x = p[a[u]];
    D -= c[x];
    if(x == 0) {
        C++;
    }

    p[a[u]] = u;
    D += c[u];
    f[u] = D;

    for(int v : s[u]) {
        dfs(v);
    }

    if(x == 0) {
        C--;
    }
    D -= c[u];
    p[a[u]] = x;
    D += c[x];
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    while(std::cin >> n) {
        
        for(int i = 2; i <= n; i++) {
            int x;
            std::cin >> x;
            s[x].push_back(i);
        }

        for(int i = 1; i <= n; i++) {
            std::cin >> a[i];
        }

        dfs(1);

        for(int i = 2; i <= n; i++) {
            std::cout << f[i] << '\n';
        }

        for(int i = 1; i <= n; i++) {
            s[i].clear();
        }
    }

    return 0;
}