#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<set>
#include<stack>
#include<stack>
using namespace std;
int n,ed,maxx;
struct node
{
    int v,w;
    node(int _v,int _w) : v(_v),w(_w) {}
};
vector<node> e[10005];
int dist[10005];
void dfs(int u,int father,int len)
{
    if(len>maxx) maxx=len,ed=u;
    for(int i=0;i<e[u].size();i++)
    {
        int v=e[u][i].v;
        int w=e[u][i].w;
        if(v==father)
            continue;
        dfs(v,u,len+w);
        dist[v]=max(dist[v],len+w);
    }
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        maxx=0;
        memset(dist,0,sizeof(dist));
        for(int i=1;i<=n;i++)
            e[i].clear();
        for(int i=2;i<=n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            e[i].push_back(node(x,y));
            e[x].push_back(node(i,y));
        }
        dfs(1,-1,0);
        dfs(ed,-1,0);
        dfs(ed,-1,0);
        for(int i=1;i<=n;i++)
            printf("%d\n",dist[i]);
    }
    return 0;
}