#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) begin(a),end(a)
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=2e5+10;
const ll INF=1e18;
int n,siz[N],val[N],son[N];
vector<pair<int,int>>to[N];
using node=vector<ll>;
using vec=array<node,2>;
using matrix=array<vec,2>;
#ifdef DEBUG
ostream& operator << (ostream &out,vec a){
	return out<<'['<<a[0]<<','<<a[1]<<']';
}
ostream& operator << (ostream &out,matrix a){
	return out<<'['<<a[0]<<','<<a[1]<<']';
}
#endif
void chkmax(ll &x,ll y){
	if(x<y)x=y;
}
void merge(node &A,const node &B,const node &C){
	if(B.empty()||C.empty())return;
	int i=1,j=1,k=1,sb=B.size(),sc=C.size();
	if(A.size()<sb+sc-1)A.resize(sb+sc-1,-INF);
	ll cur=B[0]+C[0];
	chkmax(A[0],cur);
	for(;i<sb&&j<sc;){
		chkmax(A[k++],cur+=(B[i]>C[j]?B[i++]:C[j++]));
	}
	for(;i<sb;)chkmax(A[k++],cur+=B[i++]);
	for(;j<sc;)chkmax(A[k++],cur+=C[j++]);
}
void chkmax(node &A,const node &B){
	int len=B.size();
	if(A.size()<len)A.resize(len,-INF);
	for(int i=0;i<len;i++)chkmax(A[i],B[i]);
}
void pres(node &A){
	for(int i=1,len=A.size();i<len;i++)A[i]+=A[i-1];
}
void diff(node &A){
	for(int i=A.size()-1;i>0;i--)A[i]-=A[i-1];
}
vec operator * (const vec &a,const vec &b){
	static vec c;
	c[0]=c[1]=node();
	for(int i=0;i<2;i++){
		for(int j=0;i+j<2;j++){
			merge(c[i+j],a[i],b[j]);
		}
	}
	for(int i=0;i<2;i++)diff(c[i]);
	return c;
}
matrix operator * (const matrix &a,const matrix &b){
	static matrix c;
	for(int i=0;i<2;i++)fill(c[i].begin(),c[i].end(),node());
	// debug(a);
	// debug(b);
	for(int i:{0,1}){
		for(int j:{0,1}){
			// debug("c1",c[i][j],a[i][0],b[0][j]);
			merge(c[i][j],a[i][0],b[0][j]);
			// debug(a[i][1],b[1][j]);
			merge(c[i][j],a[i][1],b[1][j]);
			diff(c[i][j]);
		}
	}
	// debug("matrix");
	// debug(a);
	// debug(b);
	// debug(c);
	return c;
}
void make(int u,int fa=0){
	siz[u]=1;
	for(auto [v,w]:to[u])if(v^fa){
		to[v].erase(find(all(to[v]),make_pair(u,w)));
		val[v]=w,make(v,u);
		siz[u]+=siz[v];
		if(siz[v]>siz[son[u]])son[u]=v;
	}
}
void ins(node &A,const node &B,int w){
	node his(A);
	static node C;
	C=B,C[0]+=w+INF,C.insert(C.begin(),-INF);
	pres(A),pres(C);
	// debug("ins",A,C);
	chkmax(A,C);
	diff(A);
	// debug("ins",his,B,w,A);
}
vec solve(int u){
	vector<pair<int,matrix>>s;
	for(int x=u;x;x=son[x]){
		vector<pair<int,vec>>t;
		for(auto [v,w]:to[x])if(v^son[x]){
			auto f=solve(v);
			auto g=f[1];
			ins(f[1],f[0],w);
			pres(f[0]),pres(g);
			chkmax(f[0],g);
			diff(f[0]);
			t.push_back({siz[v],f});
		}
		// debug(x);
		vector<int>mx(t.size());
		function<vec(int,int)>divide=[&](int l,int r){
			if(l==r)return t[l].second;
			int sum=0;
			for(int i=l;i<r;i++)mx[i]=sum+=t[i].first;
			sum=0;
			for(int i=r;i>l;i--)mx[i-1]=max(mx[i-1],sum+=t[i].first);
			int mid=min_element(mx.begin()+l,mx.begin()+r)-mx.begin();
			return divide(l,mid)*divide(mid+1,r);
		};
		matrix f;
		if(t.empty()){
			f[0][0]={0};
			if(son[x])f[0][1]={-INF,INF+val[son[x]]};
			f[1][0]={0};
		}else{
			auto g=divide(0,t.size()-1);
			if(x==8)debug(x,g);
			f[0][0]=g[0];
			ins(f[0][1]=g[1],g[0],val[son[x]]);
			// debug(x,f[0][1]);
			// debug(x,g[0]);
			// debug(x,g[1]);
			// debug(x,val[son[x]]);
			f[1][0]=g[0];
			f[1][1]=g[1];
			// debug(x,f);
		}
		s.push_back({siz[x]-siz[son[x]],f});
	}
	vector<int>mx(s.size());
	// if(u==10)for(auto x:s)debug(u,x.second);
	function<matrix(int,int)>divide=[&](int l,int r){
		if(l==r)return s[l].second;
		// debug(u,l,r);
		int sum=0;
		for(int i=l;i<r;i++)mx[i]=sum+=s[i].first;
		sum=0;
		for(int i=r;i>l;i--)mx[i-1]=max(mx[i-1],sum+=s[i].first);
		int mid=min_element(mx.begin()+l,mx.begin()+r)-mx.begin();
		auto res=divide(mid+1,r)*divide(l,mid);
		// debug(u,l,r,res);
		return res;
	};
	auto f=divide(0,s.size()-1)[0];
	debug(u,f);
	return f;
}
int main(){
	scanf("%d",&n);
	for(int i=1,u,v,w;i<n;i++){
		scanf("%d%d%d",&u,&v,&w);
		to[u].push_back({v,w}),to[v].push_back({u,w});
	}
	make(1);
	debug(ary(son,1,n));
	auto f=solve(1);
	pres(f[0]),pres(f[1]);
	auto res=f[0];
	chkmax(res,f[1]);
	for(int i=1;i<n;i++){
		if(i<res.size())printf("%lld%c",res[i],"\n "[i+1<n]);
		else printf("?%c","\n "[i+1<n]);
	}
	return 0;
}