#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-8;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,d[N],siz[N],id[N],ih,dp[N],fa[N],tp[N],son[N];vector<pii> S[N];
int rt;
void DP(int x,int La){
	siz[x]=1;for(auto i:S[x]) if(i.fi^La) DP(i.fi,x),siz[x]+=siz[i.fi],dp[x]=max(dp[x],siz[i.fi]);
	dp[x]=max(dp[x],n-siz[x]);if(dp[x]<dp[rt]) rt=x;
}
ll sum[N];int df[N];
void dfs1(int x,int La){
	d[x]=d[La]+1;df[id[x]=++ih]=x;siz[x]=1;fa[x]=La;
	for(auto i:S[x]) if(i.fi^La) sum[i.fi]=sum[x]+i.se,dfs1(i.fi,x),siz[x]+=siz[i.fi],siz[i.fi]>siz[son[x]]&&(son[x]=i.fi);
}
void dfs2(int x,int La){
	tp[x]=La;if(son[x]) dfs2(son[x],La);
	for(auto i:S[x]) if(i.fi^fa[x]&&i.fi^son[x]) dfs2(i.fi,i.fi);
}
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	ll f[M],g[M];
	void up(int v){f[v]=min(f[ls],f[rs])+g[v];}
	void build(int l=1,int r=n,int v=1){
		if(l==r){f[v]=sum[df[l]];return;}int m=l+r>>1;
		build(l,m,ls);build(m+1,r,rs);up(v);
	}
	void Pg(int v,ll w){g[v]+=w;f[v]+=w;}
	void add(int x,int y,ll w,int l=1,int r=n,int v=1){
		if(x<=l&&r<=y) return Pg(v,w);int m=l+r>>1;
		x<=m&&(add(x,y,w,l,m,ls),0);y>m&&(add(x,y,w,m+1,r,rs),0);up(v);
	}
	pair<ll,int> qry(int l=1,int r=n,int v=1){
		if(l==r){
			auto p=make_pair(f[v],l);f[v]=1e18;
			return p;
		}int m=l+r>>1;
		auto p=(f[ls]+g[v]==f[v]?qry(l,m,ls):qry(m+1,r,rs));
		up(v);p.fi+=g[v];return p;
	}
}
namespace bit{
	int f[N];
	void add(int x,int w){while(x<=n) f[x]+=w,x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
	int kth(int k){
		int x=0;
		for(int i=19;~i;i--) if(x+(1<<i)<=n&&f[x+(1<<i)]<k) x+=(1<<i),k-=f[x];
		return x+1;
	}
}
int chkin(int x,int y){return id[x]<=id[y]&&id[y]<=id[x]+siz[x]-1;}
int LCA(int x,int y){
	while(tp[x]^tp[y]){
		if(d[tp[x]]<d[tp[y]]) swap(x,y);
		x=fa[tp[x]];
	}
	return d[x]<d[y]?x:y;
}
int jump(int x,int y){
	while(d[fa[tp[y]]]>d[x]) y=fa[tp[y]];
	if(fa[tp[y]]==x) return tp[y];
	return son[x];
}
ll ans[N];
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<n;i++){
		int x,y,z;scanf("%d%d%d",&x,&y,&z);
		S[x].emplace_back(y,z);S[y].emplace_back(x,z);
	}
	dp[rt=0]=INF;DP(1,0);
	dfs1(rt,0);dfs2(rt,rt);
	ll tot=0;for(i=1;i<=n;i++) tot+=sum[i];
	auto move=[&](int x){
		ll dis=0;
		if(d[x]<d[rt]){
			dis=sum[rt]-sum[x];
			Tree::add(1,n,-dis);
			Tree::add(id[rt],id[rt]+siz[rt]-1,2*dis);
		}else{
			dis=sum[x]-sum[rt];
			Tree::add(1,n,dis);
			Tree::add(id[x],id[x]+siz[x]-1,-2*dis);
		}
		tot-=dis;rt=x;
	};
	Tree::build();
	for(i=1;i<=n;i++) bit::add(i,1);
	if(n%2==0) ans[n/2]=tot;
	for(i=n-1;i>=2;i--){
		auto p=Tree::qry();p.se=df[p.se];
		tot-=p.fi;bit::add(id[p.se],-1);
		if((bit::qry(id[rt]-1)+i-bit::qry(id[rt]+siz[rt]-1))*2>i){
			int v=0;
			int x=df[bit::kth(bit::qry(id[rt]-1))];
			if(x) x=LCA(x,rt),d[x]>d[v]&&(v=x);
			x=df[bit::kth(bit::qry(id[rt]+siz[rt]-1)+1)];
			if(x) x=LCA(x,rt),d[x]>d[v]&&(v=x);
			move(v);
		}
		int v=jump(rt,df[bit::kth(bit::qry(id[rt]-1)+bit::qry(id[rt]+siz[rt]-1)+1>>1)]);
		if((bit::qry(id[v]+siz[v]-1)-bit::qry(id[v]-1))*2>i){
			int l=df[bit::kth(bit::qry(id[v]-1)+1)];
			int r=df[bit::kth(bit::qry(id[v]+siz[v]-1))];
			move(LCA(l,r));
		}
		if(i%2==0) ans[i/2]=tot;
	}
	for(i=1;i*2<=n;i++) printf("%lld ",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}