#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];
int s[MAX];

void dfs(int v,int c,int p=-1){
    for(auto to:g[v]){
        if(to.first==p)continue;
        if(c<to.second){
            ans[v]+=s[to.first];
            dfs(to.first,k-to.second,v);
        }
        else{
            dfs(to.first,c-to.second,v);
        }
    }
}

void prec(int v,int p=-1){
    s[v]=1;
    for(auto to:g[v]){
        if(to.first==p)continue;
        prec(to.first,v);
        s[v]+=s[to.first];
    }
}

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});
    }
    for(int i=1;i<=n;i++){
        prec(i);
        dfs(i,k);
    }
    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();
}