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

#define int long long

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

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);
		}
	}
}

pair<tuple<int, int, int>, tuple<int, int, int>> merge(pair<tuple<int, int, int>, tuple<int, int, int>> a, pair<tuple<int, int, int>, tuple<int, int, int>> b) {
	if (a.first < b.first) {
		swap(a, b);
	}
	return make_pair(a.first, get<2>(b.first) && get<2>(b.first) != get<2>(a.first) && b.first > a.second ? b.first : get<2>(a.second) && a.second > b.second ? a.second : b.second);
}

void build(int l, int r, int o) {
	if (l == r) {
		val[o] = {{V[l].first, l, V[l].second}, {-1, n, 0}};
		return;
	}
	int mid = (l + r) / 2;
	build(l, mid, o << 1);
	build(mid + 1, r, o << 1 | 1);
	val[o] = merge(val[o << 1], val[o << 1 | 1]);
}

void remove(int x, int l, int r, int o) {
	if (l == r) {
		val[o] = {{-1, n, 0}, {-1, n, 0}};
		return;
	}
	int mid = (l + r) / 2;
	if (x <= mid) {
		remove(x, l, mid, o << 1);
	} else {
		remove(x, mid + 1, r, o << 1 | 1);
	}
	val[o] = merge(val[o << 1], val[o << 1 | 1]);
}

pair<tuple<int, int, int>, tuple<int, int, int>> query(int ll, int rr, int l, int r, int o) {
	if (ll <= l && r <= rr) {
		return val[o];
	} else if (ll <= r && l <= rr) {
		int mid = (l + r) / 2;
		return merge(query(ll, rr, l, mid, o << 1), query(ll, rr, mid + 1, r, o << 1 | 1));
	} else {
		return {{-1, n, 0}, {-1, n, 0}};
	}
}

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>>());
		memset(cnt, 0, sizeof(cnt));
		build(0, n - 1, 1);
		int res = 0, pos = 0;
		for (int j = 0; j < n; j++) {
			auto [d, u, v] = (cnt[get<2>(val[1].first)] > j / 2 ? val[1].second : val[1].first);
			if (u == n) {
				break;
			}
			cnt[v]++;
			res += d;
			remove(u, 0, n - 1, 1);
			ans[j + 1] = max(ans[j + 1], res);
		}
	}
	for (int i = 2; i <= n; i += 2) {
		printf("%lld ", ans[i]);
	}
}