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

#define int long long

int n, u, v, w, a[100471], fa[100471], cnt[100471], ans[100471];
vector<pair<int, int>> G[100471], V;

void dfs(int u, int f, int x, int y) {
	V.emplace_back(y, x);
	for (auto [v, w] : G[u]) {
		if (v != f) {
			dfs(v, u, x, y + w);
		}
	}
}

int find(int u) {
	return u == fa[u] ? u : fa[u] = find(fa[u]);
}

signed main() {
	scanf("%lld", &n);
	for (int i = 1; i < n; i++) {
		scanf("%lld%lld%lld", &u, &v, &w);
		G[u].emplace_back(v, w);
		G[v].emplace_back(u, w);
	}
	for (int i = 1; i <= n; i++) {
		V = {{0, i}};
		for (auto [v, w] : G[i]) {
			dfs(v, i, v, w);
		}
		sort(V.begin(), V.end(), greater<pair<int, int>>());
		a[n - 1] = n;
		for (int j = n - 2; j >= 0; j--) {
			a[j] = (V[j].second == V[j + 1].second ? a[j + 1] : j + 1);
		}
		iota(fa, fa + n + 1, 0);
		memset(cnt, 0, sizeof(cnt));
		int res = 0, pos = 0;
		for (int j = 0; j < n; j++) {
			while (find(pos) > pos) {
				pos++;
			}
			int x = pos;
			if (cnt[V[pos].second] > j / 2) {
				x = find(a[j]);
				if (x == n) {
					break;
				}
			}
			auto [d, v] = V[x];
			cnt[v]++;
			res += d;
			fa[x] = x + 1;
			ans[j + 1] = max(ans[j + 1], res);
		}
	}
	for (int i = 2; i <= n; i += 2) {
		printf("%lld ", ans[i]);
	}
}