#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
int n,x,y,z;
ll d[N],mn[N],ans[N];
vector<int>tmp;
struct tree{
	int o,sz[N],mx[N],rt,vis[N],fa[N];
	vector<pair<int,int> >v[N];
	vector<pair<int,ll> >q[N];
	void getrt(int x,int fa,int tot){
		sz[x]=1,mx[x]=0;
		for(auto p:v[x]){
			int y=p.first;
			if(!vis[y]&&y!=fa) getrt(y,x,tot),sz[x]+=sz[y],mx[x]=max(mx[x],sz[y]);
		}
		if((mx[x]=max(mx[x],tot-sz[x]))<mx[rt]) rt=x;
	}
	void getd(int x,int fa,int rt){
		if(o) q[rt].push_back({x,d[x]});
		else q[x].push_back({rt,d[x]});
		for(auto p:v[x]){
			int y=p.first;
			if(!vis[y]&&y!=fa) d[y]=d[x]+p.second,getd(y,x,rt);
		}
	}
	void div(int x){
		vis[x]=1,d[x]=0,getd(x,0,x);
		for(auto p:v[x]){
			int y=p.first;
			if(!vis[y]) rt=0,getrt(y,x,sz[y]),fa[rt]=x,div(rt);
		}
	}
	void build(){
		for(int i=1;i<n;i++)
			scanf("%d%d%d",&x,&y,&z),
			v[x].push_back({y,z}),v[y].push_back({x,z}); 
		mx[0]=1e9,getrt(1,0,n),div(rt);
	}
}t1,t2;
void calc(int l1){
	tmp.clear();
	for(auto i:t1.q[l1]){
		int x=i.first;
		for(auto j:t2.q[x]){
			int l2=j.first; ll d=i.second+j.second;
			if(~mn[l2]) ans[x]=min(ans[x],mn[l2]+d),mn[l2]=min(mn[l2],d);
			else mn[l2]=d,tmp.push_back(l2);
		}
	}
	for(int i:tmp) mn[i]=-1;
}
signed main(){
	scanf("%d",&n),t1.o=1,t1.build(),t2.build();
	for(int i=1;i<=n;i++) ans[i]=1e18,mn[i]=-1;
	for(int i=1;i<=n;i++)
		calc(i),reverse(t1.q[i].begin(),t1.q[i].end()),calc(i);
	for(int i=1;i<=n;i++) printf("%lld\n",ans[i]);
	return 0;
}