#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 1000'000'007, N = 200005, M = 18;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}

int n,tl[N],tr[N],siz[N],par[N][M],par2[N],cnt2[N];
ll dis[N],sum2[N],sum3[N];
vector<int> adj[N];
bool vis2[N];

void dfs1(int u){
    static int t=-1;
    tl[u]=++t;
    if(par[u][0]>=0) dis[u]+=dis[par[u][0]];
    for(int i=1; i<M; ++i) par[u][i]=par[u][i-1]==-1?-1:par[par[u][i-1]][i-1];
    for(auto v: adj[u]) if(v!=par[u][0]) dfs1(v);
    tr[u]=t;
}

bool is_anc(int u, int v){return tl[u]<=tl[v]&&tr[u]>=tr[v];}

int lca(int u, int v){
    if(is_anc(u,v)) return u;
    for(int i=M-1; i>=0; --i) if(par[u][i]>=0&&!is_anc(par[u][i],v)) u=par[u][i];
    return par[u][0];
}

ll get_dis(int u, int v){return dis[u]+dis[v]-2*dis[lca(u,v)];}

void dfs2(int u, int fa){
    siz[u]=1;
    for(auto v: adj[u]) if(!vis2[v]&&v!=fa) dfs2(v,u),siz[u]+=siz[v];
}

int findG(int u, int fa, int m){
    for(auto v: adj[u]) if(!vis2[v]&&v!=fa&&siz[v]>m/2) return findG(v,u,m);
    return u;
}

void centroid(int u, int fa){
    dfs2(u,-1);
    int g=findG(u,-1,siz[u]);
    vis2[g]=1,par2[g]=fa;
    for(auto v: adj[g]) if(!vis2[v]) centroid(v,g);
}

void add(int u){
    for(int i=u; i>=0; i=par2[i]){
        cnt2[i]++;
        if(par2[i]>=0){
            ll tmp=get_dis(u,par2[i]);
            sum2[par2[i]]+=tmp,sum3[i]+=tmp;
        }
    }
}

ll query(int u){
    ll res=sum2[u];
    for(int i=u; par2[i]>=0; i=par2[i]){
        res+=(cnt2[par2[i]]-cnt2[i])*get_dis(u,par2[i])+(sum2[par2[i]]-sum3[i]);
        //cout << "res " << (cnt2[par2[i]]-cnt2[i]) << ' ' << get_dis(u,par2[i]) << ' ' << (sum2[par2[i]]-sum3[i]) << ' ' << res << endl;
    }
    return res;
}

int bit[N];
void add_bit(int u){for(int i=tl[u]+1; i<N; i+=i&-i) bit[i]++;}
int query_bit(int u){
    int res=0;
    for(int i=tr[u]+1; i; i-=i&-i) res+=bit[i];
    for(int i=tl[u]; i; i-=i&-i) res-=bit[i];
    return res;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n;
    par[0][0]=-1;
    for(int i=1; i<n; ++i){
        cin >> par[i][0] >> dis[i];
        par[i][0]--;
        adj[par[i][0]].pb(i),adj[i].pb(par[i][0]);
    }
    dfs1(0);
    centroid(0,-1);
    //for(int i=0; i<n; ++i) cout << par2[i] << ' ';
    //cout << endl;
    //cout << dis[1] << ' ' << dis[2] << ' ' << get_dis(1,2) << endl;
    int cur=0;
    for(int i=0; i<n; ++i){
        add(i),add_bit(i);
        for(int j=M-1; j>=0; --j) if(par[cur][j]>=0&&query_bit(par[cur][j])<=(i+1)/2) cur=par[cur][j];
        if(query_bit(cur)<=(i+1)/2) cur=par[cur][0];
        if(is_anc(cur,i)){
            int cur2=i;
            for(int j=M-1; j>=0; --j) if(par[cur2][j]>=0&&query_bit(par[cur2][j])<=(i+1)/2) cur2=par[cur2][j];
            if(query_bit(cur2)<=(i+1)/2) cur2=par[cur2][0];
            cur=cur2;
        }
        //cout << i << ' ' << cur << endl;
        cout << query(cur) << "\n";
    }
}