#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
#define endl '\n'
typedef vector<int> vi;
typedef pair<long long,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef tuple<int,int,int> iii;
int n,k,leafcnt;
vector<vii> adj;
vi bestup;
vi dist;
vii best;
int dfs(int node,int p){
int mxdist = 0,mxleaf = node;
for (auto tp : adj[node]){
int to,w; tie(to,w) = tp;
if (to == p) continue;
int leaf = dfs(to,node);
dist[leaf] += w;
if (adj[to].size() == 1) leafcnt++;
if (dist[leaf] > mxdist){
mxleaf = leaf;
mxdist = dist[leaf];
}
}
return mxleaf;
}
void cal(int node, int p) {
for (auto tp : adj[node]) {
int to, w;
tie(to, w) = tp;
if (to == p) continue;
cal(to, node);
int v1 = best[to].F + w;
if (v1 > best[node].F) {
best[node].S = best[node].F;
best[node].F = v1;
} else if (v1 > best[node].S) {
best[node].S = v1;
}
}
}
void ters(int node,int p){
for (auto tp : adj[node]){
int to,w; tie(to,w) = tp;
if (to == p) continue;
if (best[node].F == w + best[to].F) bestup[to] = w + best[node].S;
else bestup[to] = w + best[node].F;
bestup[to] = max(bestup[to],bestup[node] + w);
ters(to,node);
}
}
void solve1();
void solve2();
int32_t main(){
ios_base::sync_with_stdio(NULL);cin.tie(NULL); cout.tie(NULL);
cin >> n >> k;
adj.assign(n + 10,vii());
for (int i = 0; i < n-1; i++){
int u,v,w; cin >> u >> v >> w; u--; v--;
adj[u].eb(v,w);
adj[v].eb(u,w);
}
if (k == 1) solve1();
else solve2();
return 0;
}
void solve2(){
for (int root = 0; root < n; root++){
leafcnt = 0;
dist.assign(n,0);
dfs(root,-1);
sort(all(dist),greater<int>());
int ans = 0;
for (int i = 0; i < min(k,leafcnt); i++) ans += dist[i];
cout << ans << endl;
}
}
void solve1(){
best.assign(n + 10, {0, 0});
bestup.assign(n +10 ,0);
cal(0,-1);
ters(0,-1);
for (int root = 0; root < n; root++){
cout << max(best[root].F,bestup[root]) << endl;
}
}
