#include <bits/stdc++.h>

#define int long long

using namespace std;

const int inf=1e18;
const int MAX=3e5+10;
const int mod=1e9+7;

int n,k;
vector<pair<int,int>> g[MAX];
int ans[MAX];
vector<int> ord;
vector<int> r;

void dfs(int v,int p=-1){
    ord.push_back(v);
    for(auto to:g[v]){
        if(to.first==p)continue;
        r.push_back(to.second);
        dfs(to.first,v);
    }
}

void solve(){
    cin>>n>>k;
    for(int i=1;i<n;i++){
        int a,b,c;
        cin>>a>>b>>c;
        a++,b++;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    int l=-1;
    for(int i=1;i<=n;i++){
        if(g[i].size()==1)l=i;
    }
    dfs(l);
    int minus=0;
    multiset<pair<int,int>> st;
    for(int i=0;i<n-1;i++){
        int cnt=1;
        while(!st.empty()&&st.begin()->first-minus<r[i]){
            // cout<<ord[i]<<" "<<st.begin()->second<<" "<<n-i-1<<"\n";
            ans[ord[i]]+=st.begin()->second*(n-i-1);
            cnt+=st.begin()->second;
            st.erase(st.begin());
        }
        st.insert({k+minus,cnt});
        minus+=r[i];
    }
    reverse(ord.begin(),ord.end());
    reverse(r.begin(),r.end());
    minus=0;
    for(int i=0;i<n-1;i++){
        int cnt=1;
        while(!st.empty()&&st.begin()->first-minus<r[i]){
            ans[ord[i]]+=st.begin()->second*(n-i-1);
            cnt+=st.begin()->second;
            st.erase(st.begin());
        }
        st.insert({k+minus,cnt});
        minus+=r[i];
    }
    for(int i=1;i<=n;i++)cout<<ans[i]<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}