#include<iostream>
#include<vector>
using ll = long long;
int n, a[100005], c[100005], p[100005]; ll f[100005];
std::vector<int> son[100005];
void dfs(int u) {
	static int C; static ll D; c[u] = C;
	int x = p[a[u]]; D -= c[x];
	if (!x) C++; p[a[u]] = u, D += c[u];
	f[u] = D;
	for (int v : son[u]) dfs(v);
	if (!x) C--; D -= c[u], p[a[u]] = x, D += c[x];
}
int main() {
	std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
	while (std::cin >> n) {
		for (int i = 2; i <= n; i++) {
			int x; std::cin >> x, son[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++) son[i].clear();
	}
}