#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MN = 1e5+5;
int N, sz[MN]; vector<ll> diffs[MN]; vector<pair<int,int>> adjl[MN]; ll ans[MN];
struct KMin{
multiset<ll> st; int k;
void init(int _k){ k = _k; st.clear(); }
void insert(ll x){ st.insert(x); }
void erase(ll x){ st.erase(st.find(x)); }
void decK(){ assert(k--); }
ll query(){
assert(st.size() >= k);
ll ret = 0;
int i = 0;
for(auto it = st.begin(); i < k; i++, it++)
ret += *it;
return ret;
}
} kMin;
void dfs(int u){
sort(adjl[u].begin(), adjl[u].end(), [](pair<int,int> lhs, pair<int,int> rhs){
return sz[lhs.first] > sz[rhs.first];
});
for(auto [v, w]: adjl[u]){
adjl[v].erase(find(adjl[v].begin(), adjl[v].end(), pair(u, w)));
dfs(v);
}
diffs[u].resize(sz[u]);
kMin.init(sz[u] - 1);
for(auto [v, w]: adjl[u])
kMin.insert(w);
for(int k = 1; k < sz[u]; k++){
for(auto [v, w]: adjl[u]){
if(sz[v] <= k) break;
kMin.erase(w);
kMin.insert(w - diffs[v][k]);
}
assert(kMin.k == sz[u] - k);
ll res1 = kMin.query();
kMin.decK();
assert(kMin.k == sz[u] - 1 - k);
ll res2 = kMin.query();
ans[k] += res1;
diffs[u][k] = res1 - res2;
for(auto [v, w]: adjl[u]){
if(sz[v] <= k) break;
kMin.insert(w);
kMin.erase(w - diffs[v][k]);
}
}
}
vector<ll> minimum_closure_costs(int _N, vector<int> us, vector<int> vs,
vector<int> ws){
N = _N;
for(int i = 0, u, v, w; i < N-1; i++){
u = us[i]; v = vs[i]; w = ws[i];
adjl[u].emplace_back(v, w);
adjl[v].emplace_back(u, w);
}
for(int i = 0; i < N; i++)
sz[i] = adjl[i].size();
++sz[0];
dfs(0);
ans[0] = accumulate(ws.begin(), ws.end(), 0LL);
for(int i = 1; i < sz[0]; i++)
ans[i] -= diffs[0][i];
return vector<ll>(ans, ans+N);
}
#ifdef LOCAL_PROJECT
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int N; cin >> N;
vector<int> us(N-1), vs(N-1), ws(N-1);
for(int i = 0; i < N-1; i++)
cin >> us[i] >> vs[i] >> ws[i];
vector<ll> ans = minimum_closure_costs(N, us, vs, ws);
for(int i = 0; i < N; i++)
printf("%d%c", ans[i], " \n"[i==N-1]);
return 0;
}
#endif
