#include <bits/stdc++.h>
#define int long long
#define N 10005
#define pb push_back
#define mod 1000000007
#define fi first
#define se second
#define all(x) x.begin(), x.end()
//#define sz(x) (int)x.size()
#define pii pair<int,int>
#define INF 1e18
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define FORD(i, a, b) for(int i = a; i >= b; --i)
using namespace std;
int n, dp[N][105][2], sum[N], sz[N];
vector<pii> g[N];
void dfs(int u, int p)
{
for(auto [v, w] : g[u])
{
if (v == p) continue;
sum[v] = sum[u] + w;
dfs(v, u);
}
}
void calc(int u, int p)
{
dp[u][0][0] = dp[u][1][0] = 0;
dp[u][1][1] = -sum[u];
sz[u] = 1;
for(auto [v, w] : g[u])
{
if (v == p) continue;
calc(v, u);
FORD(i, sz[u], 0)
{
FOR(j, 0, sz[v])
{
int c = (j > 0 ? 2 * w : 0);
dp[u][i + j][0] = min(dp[u][i + j][0], dp[u][i][0] + dp[v][j][0] + c);
dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][0] + dp[v][j][1]+ c);
dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][1] + dp[v][j][0] + c);
}
}
sz[u] += sz[v];
}
}
void Proc()
{
cin >> n;
FOR(i, 1, n - 1)
{
int u, v, w;
cin >> u >> v >>w;
g[u].pb({v, w});
g[v].pb({u, w});
}
dfs(1, 0);
memset(dp, 0x3f, sizeof dp);
calc(1, 0);
FOR(i, 1, n) cout << dp[1][i][1] << '\n';
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T; T = 1;
//cin >> T;
while (T--) Proc();
}
