#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using poly=basic_string<i64>;
using A4=array<poly,4>;
using A2=array<poly,2>;
constexpr i64 finf=-2e18;
poly mul(poly f,poly g){
	int fn=f.size(),gn=g.size(),n=fn+gn-1;
	f+=finf,g+=finf; 
	poly r(n,0);r[0]=f[0]+g[0];
	for(int i=1,j=0,k=0;i<n;i++)
	(f[j+1]-f[j]>g[k+1]-g[k]?j:k)++,r[i]=max(f[j]+g[k],finf);
	return r;
}
poly dot(poly f,poly g){
	if(f.size()<g.size())swap(f,g);
	for(int i=0;i<g.size();i++)f[i]=max(f[i],g[i]);
	return f;
}
A4 mul(A4 f,A4 g){
	A4 r;
	for(int i:{0,1})for(int k:{0,1})
	r[i<<1|k]=dot(mul(f[i<<1],g[k]),mul(f[i<<1|1],g[2|k]));
	return r;
}
A2 mul(A2 f,A2 g){return{mul(f[0],g[0]),dot(mul(f[0],g[1]),mul(f[1],g[0]))};}//[0]:不和rt match;[1]:match
map<pair<int,int>,int>ew;
basic_string<int>G[200010];
int sz[200010],fa[200010],dfn[200010],len[200010],tot;
void dfs1(int u){
	if(fa[u])G[u].erase(find(begin(G[u]),end(G[u]),fa[u]));
	sz[u]=1;
	for(int&v:G[u]){
		fa[v]=u,dfs1(v),sz[u]+=sz[v];
		if(sz[v]>sz[G[u][0]])swap(v,G[u][0]);
	}
}
void dfs2(int u){dfn[u]=++tot,len[u]=1;for(int v:G[u])dfs2(v),v==G[u][0]&&(len[u]=len[v]+1);}
auto calc=[](auto a,int m){
	for(int hf=1;hf<m;hf<<=1)
	for(int i=0;i+hf<m;i+=hf*2)
	a[i]=mul(a[i],a[i+hf]),a[i+hf]={};
	return a[0];
};
A4 awa[200010];
void solve(int u){
	vector<A2>ls;
	for(int v:G[u]){solve(v);if(v!=G[u][0])ls.push_back({dot(awa[dfn[v]][0],awa[dfn[v]][1]),awa[dfn[v]][2]});}
	auto t=ls.empty()?A2{{{0},{finf}}}:calc(ls.data(),ls.size());
	awa[dfn[u]][0]=dot(t[0],t[1]),awa[dfn[u]][1]=t[0],
	awa[dfn[u]][2]=mul(t[0],{finf,ew[{u,fa[u]}]}),awa[dfn[u]][3]={finf};
	if(u==1||u!=G[fa[u]][0])calc(awa+dfn[u],len[u]);
}
int main(){
	int n;cin>>n;assert(n<200000);
	for(int i=1,u,v,w;i<n;i++)
	scanf("%d%d%d",&u,&v,&w),ew[{u,v}]=ew[{v,u}]=w,G[u]+=v,G[v]+=u;
	dfs1(1),dfs2(1),solve(1);
	for(int i=1;i<n;i++)
	if(i>=awa[1][0].size())printf("? ");
	else printf("%lld ",awa[1][0][i]);
	return 0;
}