#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

int n;
vector<pair<int, int> > g[100500];
int sz[100500];

int dfs1(int v, int p, int W)
{
    sz[v] = W;
    for (auto [i, w] : g[v])
        if (i != p)
            sz[v] += dfs1(i, v, w);
    return sz[v];
}

int m = 0;
multiset<int> d[100500];
int cnt[100500];
int total[100500];

void dfs2(int v, int dep, int p)
{
    d[m].insert(dep);
    for (auto [i, w] : g[v])
        if (i!=p)
            dfs2(i, dep+w, v);
}

/*
7
1 3 99
2 3 82
3 4 4
4 5 43
5 6 5
4 7 3
 */

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    cin>>n;
    int SW = 0;
    for (int i=1; i<n; i++) {
        int x, y, w;
        cin>>x>>y>>w;
        SW += w;
        g[x].pb({y, w});
        g[y].pb({x, w});
    }

    dfs1(1, -1, 0);
    int C = 1;
    int P = -1;
    while (true)
    {
        bool ok = false;
        for (auto [i, w] : g[C])
            if (i!=P)
            if (2*sz[i] >= SW)
            {
                P = C;
                C = i;
                ok = true;
                break;
            }
        if (!ok)
            break;
    }
    m++;
    d[m] = {0};
    for (auto [i, w] : g[C])
    {
        m++;
        dfs2(i, w, C);
    }
    set<pair<int, int> > ms;
    for (int i=1; i<=m; i++)
    {
        ms.insert({*prev(d[i].end()), i});
        cnt[i] = 0;
    }
    int ans = 0;
    for (int id=1; id<=n/2; id++)
    {
        auto [w, i] = *prev(ms.end());
        ms.erase({w, i});
        ans += w;
        d[i].erase(d[i].find(w));
        if (d[i].size() > 0)
            ms.insert({*prev(d[i].end()), i});
        cnt[i]++;

        tie(w, i) = *prev(ms.end());
        if (cnt[i] < id)
        {
            ms.erase({w, i});
            ans += w;
            d[i].erase(d[i].find(w));
            if (d[i].size() > 0)
                ms.insert({*prev(d[i].end()), i});
            cnt[i]++;
        }
        else
        {
            tie(w, i) = *prev(prev(ms.end()));
            ms.erase({w, i});
            ans += w;
            d[i].erase(d[i].find(w));
            if (d[i].size() > 0)
                ms.insert({*prev(d[i].end()), i});
            cnt[i]++;
        }
        cout<<ans<<"\n";
    }
}