#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10, M = 4e5 + 10;
int n, w[N], h[N], e[M], ne[M], idx;
inline void add(int a, int b) {e[idx] = b, ne[idx] = h[a], h[a] = idx ++; }


int fa[N], dfn[N], siz[N], son[N], top[N], dfs_clock;
void dfs(int u, int f) {
    fa[u] = f, siz[u] = 1, son[u] = 0;
    for(int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i]; if(v == f) continue;
        dfs(v, u), siz[u] += siz[v];
        if(siz[v] > siz[son[u]]) son[u] = v;
    }
}
void hld(int u, int topf) {
    top[u] = topf, dfn[u] = ++dfs_clock;
    if(!son[u]) return;
    hld(son[u], topf);
    for(int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i]; if(v == fa[u] || v == son[u]) continue;
        hld(v, v);
    }
}
struct Fenwick {
    long long C[N];
    Fenwick() {memset(C, 0, sizeof C); }
    inline void clear() {memset(C + 1, 0, sizeof(long long) * n); }
    inline void add(int p, int x) {for(; p <= n; p += p & -p) C[p] += x; }
    inline long long ask(int p) {long long r = 0; for(; p; p -= p & -p) r += C[p]; return r; }
    inline long long ask(int l, int r) {return ask(r) - ask(l - 1); }
    inline long long ask_subtree(int u) {return ask(dfn[u], dfn[u] + siz[u] - 1); }
} BIT, BIT2;

int f[N];

inline void solve() {
    idx = 0, dfs_clock = 0;
    memset(h + 1, -1, sizeof(int) * n);
    for(int i = 1; i <= n; i ++)
        cin >> w[i];
    for(int i = 2; i <= n; i ++) {
        int x; cin >> x;
        add(x, i), add(i, x);
    }
    dfs(1, 0), hld(1, 1);
    // for(int i = 1; i <= n; i ++)
    //     cout << top[i] << " \n"[i == n];
    for(int i = 1; i <= n; i ++) f[i] = 0;
    for(int i = 1; i <= n; i ++) {
        int u = i;
        f[i] += w[u] * BIT.ask_subtree(u), u = top[u];
        while(fa[u]) {
            f[i] += w[fa[u]] * (BIT.ask_subtree(fa[u]) - BIT.ask_subtree(u));
            u = top[fa[u]];
        }
        int lst = i;
        while(lst) {
            int now = top[lst];
            if(now != lst) f[i] += BIT2.ask(dfn[now], dfn[lst] - 1);
            lst = fa[now];
        }
        u = i;
        BIT.add(dfn[u], 1);
        while(u) {
            BIT2.add(dfn[u], w[u]);
            u = fa[top[u]];
        }
    }
    for(int i = 2; i <= n; i ++)
        cout << f[i] << '\n';
    BIT.clear(), BIT2.clear();
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);

    while(cin >> n) solve();

    return 0;
}