#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N = 3e5 + 10;
int n, k, id, p[N];
ll cost[N];
priority_queue<ll, vector<ll>, greater<ll>> q;

struct edge {
	int u, v; ll w;
	bool operator < (const edge &o) const {
		return w < o.w;
	}
}e[N];

int find(int x) {
	if(x == p[x]) return x;
	else return p[x] = find(p[x]);
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	
	cin >> n >> k;
	for(int i = 1; i < n; i++) {
		int u, v;
		ll w;
		cin >> u >> v >> w;
		e[++id] = {u, v, w};
	}
	for(int i = 1; i <= n; i++) p[i] = i;
	sort(e + 1, e + id + 1);
	for(int i = 1; i < n; i++) {
		int u = e[i].u, v = e[i].v;
		ll w = e[i].w;
		u = find(u), v = find(v);
		if(u < v) swap(u, v);
		p[u] = v;
		cost[u] = w;
	}
	ll ans = 0;
	for(int i = 1; i <= n; i++) {
		ans += cost[i];
		q.push(cost[i]);
		if(i > k) {
			ans -= q.top();
			q.pop();
		}
		cout << ans << "\n";
	}
	return 0;
}