#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 MOD=1e9+7; int n,k; vii adj[MAXN]; deque<int> mx[MAXN], dp[MAXN]; //hepsi büyükten küçüğe sorted deque<int> merge(deque<int> a,deque<int> b,int cost){ deque<int> c; if(cost){ if(b.empty()) b.pb(cost); else b[0]+=cost; } int pt1=0; int pt2=0; int sz1=a.size(); int sz2=b.size(); while(pt1<sz1 or pt2<sz2){ if(pt2>=sz2 or (pt1<sz1 and a[pt1]>=b[pt2])){ c.pb(a[pt1++]); } else{ c.pb(b[pt2++]); } if(c.size()==k) break; } return c; } void dfs(int nd,int ata){ for(auto [kom,cost]:adj[nd]){ if(kom==ata) continue; dfs(kom,nd); mx[nd]=merge(mx[nd],mx[kom],cost); } } void dfs2(int nd,int ata){ vii vec; for(auto [kom,cost]:adj[nd]){ if(kom==ata) continue; vec.pb({kom,cost}); } int sz=vec.size(); deque<int> cur; //pref hesapla FOR(i,sz){ int kom=vec[i].fi; int cost=vec[i].se; dp[kom]=merge(dp[kom],cur,0); cur=merge(cur,mx[kom],cost); } cur.clear(); //suf hesapla for(int i=sz-1;i>=0;i--){ int kom=vec[i].fi; int cost=vec[i].se; dp[kom]=merge(dp[kom],cur,0); cur=merge(cur,mx[kom],cost); } FOR(i,sz){ int kom=vec[i].fi; int cost=vec[i].se; dp[kom]=merge(dp[kom],dp[nd],0); if(!dp[kom].empty()) dp[kom][0]+=cost; } for(auto el:vec) dfs2(el.fi,nd); } 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}); } dfs(1,-1); dfs2(1,-1); deque<int> vec; FORE(i,1,n+1){ vec=merge(dp[i],mx[i],0); int ans=0; for(auto el:vec) ans+=el; cout<<ans<<endl; } }