#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=1e5+5; const int INF=1e18; const int MOD=1e9+7; int n,k; vii adj[MAXN]; int mx[MAXN]; int dp[MAXN]; void dfs(int nd,int ata){ mx[nd]=0; for(auto [kom,cost]:adj[nd]){ if(kom==ata) continue; dfs(kom,nd); mx[nd]=max(mx[nd],mx[kom]+cost); } } void dfs2(int nd,int ata){ int bir,iki; bir=iki=-1; for(auto [kom,cost]:adj[nd]){ if(kom==ata) continue; int deg=mx[kom]+cost; if(deg>bir){ iki=bir; bir=deg; } else if(deg>iki){ iki=deg; } } for(auto [kom,cost]:adj[nd]){ if(kom==ata) continue; int deg=bir; if(mx[kom]+cost==bir) deg=iki; dp[kom]=max(dp[nd],deg)+cost; dfs2(kom,nd); } } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); //freopen("out.txt","w",stdout); 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); FORE(i,1,n+1) cout<<max(mx[i],dp[i])<<endl; }