#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define sp <<' '<<
#define fi first
#define se second
#define pb push_back
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> oset;
#define all(x) x.begin(),x.end()
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(a,b) ((a%MOD)*(b%MOD))%MOD
#define topla(a,b) ((a%MOD)+(b%MOD))%MOD
#define mid (l+r)/2
const int MAXN=2e3+5;
const int INF=1e18;
const int MOD=1e9+7;
int n,k;
vii adj[MAXN];
map<int,int> tut[MAXN];
void merge(map<int,int>& a,map<int,int>& b){
if(a.size()<b.size()) a.swap(b);
for(auto el:b) a[el.fi]+=el.se;
}
void dfs(int nd,int ata){
tut[nd].clear();
for(auto [kom,cost]:adj[nd]){
if(kom==ata) continue;
dfs(kom,nd);
int el=0;
if(!tut[kom].empty()){
el=tut[kom].rbegin()->fi;
tut[kom][el]--;
}
tut[kom][el+cost]++;
merge(tut[nd],tut[kom]);
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n>>k;
FOR(i,n-1){
int a,b,c;
cin>>a>>b>>c;
adj[a].pb({b,c});
adj[b].pb({a,c});
}
FORE(i,1,n+1){
//solve for all roots
dfs(i,-1);
int ans=0;
int say=0;
while(say<k){
if(tut[i].empty()) break;
auto el=*tut[i].rbegin();
tut[i].erase(el.fi);
ans+=min(k-say,el.se)*el.fi;
say+=min(k-say,el.se);
}
cout<<ans<<endl;
}
}
