#include <bits/stdc++.h>
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int SZ = 1 << 18;
vector<int> G[SZ];
int W[SZ], H[SZ], P[SZ], Z[SZ], in[SZ], out[SZ], top[SZ], dn;
ll U[SZ << 1];

int DFS(int cur, int prev) {
	H[cur] = H[prev] + 1;
	P[cur] = prev;
	int& ret = Z[cur] = 1;
	for (int& next : G[cur]) {
		ret += DFS(next, cur);
		if (Z[next] > Z[G[cur][0]]) swap(next, G[cur][0]);
	}
	return ret;
}

void DFS2(int cur) {
	in[cur] = ++dn;
	for (int next : G[cur]) {
		top[next] = (next == G[cur][0] ? top[cur] : next);
		DFS2(next);
	}
	out[cur] = dn;
}

int LCA(int a, int b) {
	while (top[a] != top[b]) {
		if (H[top[a]] > H[top[b]]) swap(a, b);
		b = P[top[b]];
	}
	return (in[a] < in[b] ? a : b);
}

struct Seg {
	ll T[SZ << 1], Z[SZ << 1];
	void Push(int n) {
		if (!Z[n]) return;
		if (n < SZ) {
			Z[n * 2] += Z[n];
			Z[n * 2 + 1] += Z[n];
		}
		// cout << "temp " << U[n] << '\n';
		T[n] += Z[n] * U[n];
		Z[n] = 0;
	}
	void Update(int L, int R, int v, int sL = 1, int sR = SZ, int n = 1) {
		Push(n);
		if (R < sL || sR < L) return;
		if (L <= sL && sR <= R) {
			Z[n] += v;
			Push(n);
			return;
		}
		int mid = (sL + sR) >> 1;
		Update(L, R, v, sL, mid, n * 2);
		Update(L, R, v, mid + 1, sR, n * 2 + 1);
		T[n] = T[n * 2] + T[n * 2 + 1];
	}
	ll Query(int L, int R, int sL = 1, int sR = SZ, int n = 1) {
		Push(n);
		if (R < sL || sR < L) return 0;
		if (L <= sL && sR <= R) return T[n];
		int mid = (sL + sR) >> 1;
		return Query(L, R, sL, mid, n * 2) + Query(L, R, mid + 1, sR, n * 2 + 1);
	}
	void PathUpdate(int a, int b) {
		while (top[a] != top[b]) {
			if (H[top[a]] > H[top[b]]) swap(a, b);
			Update(in[top[b]], in[b], 1);
			b = P[top[b]];
		}
		if (H[a] > H[b]) swap(a, b);
		Update(in[a], in[b], 1);
	}
	ll PathQuery(int a, int b) {
		ll ret = 0;
		while (top[a] != top[b]) {
			if (H[top[a]] > H[top[b]]) swap(a, b);
			ret += Query(in[top[b]], in[b]);
			b = P[top[b]];
		}
		if (H[a] > H[b]) swap(a, b);
		ret += Query(in[a], in[b]);
		return ret;
	}
} T;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N;
	while (cin >> N, !cin.eof()) {
		for (int i = 1; i <= N; ++i) cin >> W[i];
		for (int i = 2; i <= N; ++i) {
			int p;
			cin >> p;
			G[p].push_back(i);
		}

		DFS(1, 0);
		top[1] = 1;
		DFS2(1);

		for (int i = 1; i <= N; ++i) {
			int p = in[i] + SZ - 1;
			U[p] = W[i] - W[P[i]];
			while (p >>= 1) U[p] = U[p * 2] + U[p * 2 + 1];
		}

		T.PathUpdate(1, 1);
		for (int i = 2; i <= N; ++i) {
			ll ans = T.PathQuery(1, i);
			cout << ans << '\n';
			T.PathUpdate(1, i);
		}

		for (int i = 1; i <= N; ++i) {
			G[i].clear();
			ll t = (U[in[i] + SZ - 1] ? -T.Query(in[i], in[i]) / U[in[i] + SZ - 1] : 0LL);
			T.Update(in[i], in[i], t);
			int p = (i + SZ - 1) * 2;
			while (p >>= 1) U[p] = 0;
		}
		dn = 0;
	}
	return 0;
}