#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T &x){
	x=0;
	bool flag=0;
	char ch=getchar();
	while(ch<'0'||ch>'9') flag=flag||(ch=='-'),ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
	read(x),read(args...);
}
template<typename T>inline void prt(T x){
	if(x>9) prt(x/10);
	putchar(x%10+'0');
}
template<typename T>inline void put(T x){
	if(x<0) putchar('-'),x=-x;
	prt(x);
}
template<typename T>inline void put(char ch,T x){
	put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
	put(ch,x),put(ch,args...);
}
#define ll long long
#define inf 0x3f3f3f3f3f3f3f3f
#define N 200005
#define convex vector<ll>
#define matrix array<array<convex,2>,2>
inline convex minkowski(const convex &a,const convex &b){
	if(!a.size()||!b.size()) return convex();
	convex c(a.size()+b.size()-1);
	c[0]=a[0]+b[0];
	int i=1,j=1,k=1;
	while(i<a.size()&&j<b.size()) 
		if(a[i]-a[i-1]<b[j]-b[j-1]) c[k++]=a[i]-a[i-1],i++;
		else c[k++]=b[j]-b[j-1],j++;
	while(i<a.size()) c[k++]=a[i]-a[i-1],i++;
	while(j<b.size()) c[k++]=b[j]-b[j-1],j++;
	for(int i=1;i<c.size();i++) c[i]+=c[i-1];
	return c;
}
inline convex operator+(convex a,const ll &b){
	convex c(a.size()+1);
	for(int i=0;i<a.size();i++) c[i+1]=a[i]+b;
	c[0]=-inf;
	return c;
}
inline convex max(const convex &a,const convex &b){
	convex c(max(a.size(),b.size()));
	for(int i=0;i<max(a.size(),b.size());i++){
		c[i]=-inf;
		if(i<a.size()) c[i]=max(c[i],a[i]);
		if(i<b.size()) c[i]=max(c[i],b[i]);
	}
	return c;
}
int dis[N],st[N];
convex f[N][2];
inline matrix merge1(int l,int r){
	matrix res;
	if(l==r){
		res[0][1]=res[1][0]=f[st[l]][0],res[1][1]=max(f[st[l]][0],f[st[l]][1]);
		return res;
	}
	int mid=l+r>>1;
	matrix L=merge1(l,mid),R=merge1(mid+1,r);
	for(int a=0;a<2;a++)
		for(int b=0;b<2;b++)
			res[a][b]=max(minkowski(L[a][0],R[0][b])+dis[mid],minkowski(L[a][1],R[1][b]));
	res[1][0]=max(res[1][0],res[0][0]);
	res[0][1]=max(res[0][1],res[0][0]);
	res[1][1]=max(max(res[0][1],res[1][0]),res[1][1]);
	return res;
}
inline matrix merge2(int l,int r){
	matrix res;
	if(l==r){
		res[0][0]=f[st[l]][0],res[0][1]=f[st[l]][1];
		return res;
	}
	int mid=l+r>>1;
	matrix L=merge2(l,mid),R=merge2(mid+1,r);
	res[0][0]=minkowski(L[0][0],R[0][0]);
	res[0][1]=max(minkowski(L[0][1],R[0][0]),minkowski(L[0][0],R[0][1]));
	return res;
}
int n,fa[N],siz[N],son[N],vson[N],dep[N],dfn[N],top[N],idx;
vector<pair<int,int>> e[N];
inline void dfs1(int x,int fat){
	fa[x]=fat,siz[x]=1,dep[x]=dep[fat]+1;
	for(auto tmp:e[x]){
		int v=tmp.first;
		if(v==fat) continue;
		dfs1(v,x),siz[x]+=siz[v];
		if(siz[v]>siz[son[x]]) son[x]=v,vson[x]=tmp.second;
	}
}
inline void dfs2(int x,int tf){
	top[x]=tf,dfn[x]=++idx;
	if(son[x]) dfs2(son[x],tf);
	for(auto tmp:e[x])
		if(tmp.first!=fa[x]&&tmp.first!=son[x]) dfs2(tmp.first,tmp.first);
	if(x!=tf) return;
	for(int p=x;p;p=son[p]){
		int tp=0;
		for(auto tmp:e[p]){
			int v=tmp.first,w=tmp.second;
			if(v==fa[p]||v==son[p]) continue;
			st[++tp]=v;
			convex f0=f[v][0],f1=f[v][1];
			f[v][0]=max(f0,f1),f[v][1]=f0+w;
		}
		if(!tp) f[p][0]=f[p][1]={0};
		else{
			matrix res=merge2(1,tp);
			f[p][0]=res[0][0],f[p][1]=res[0][1];	
		}
	}
	int tp=0;
	for(int p=x;p;p=son[p]) st[++tp]=p,dis[tp]=vson[p];
	matrix res=merge1(1,tp);
	f[x][0]=max(res[0][0],res[0][1]),f[x][1]=max(res[1][0],res[1][1]);
}
int main(){
	read(n);
	for(int i=1,u,v,w;i<n;i++)
		read(u,v,w),e[u].emplace_back(v,w),e[v].emplace_back(u,w);
	dfs1(1,0),dfs2(1,1);
	convex res=max(f[1][0],f[1][1]);
	for(int i=1;i<n;i++){
		if(i<res.size()) put(' ',res[i]);
		else putchar('?'),putchar(' ');
	}
	return 0;
}