#include <bits/stdc++.h>

using namespace std;
    
typedef long long ll;
const int  N = 1e5 + 12, MOD = (int)1e9 + 7;

int n,a[N],k;
bool rt[N];
ll pref[N];
vector<int> g[N];
ll cost(ll l,ll r) {
    if(l > r) swap(l,r);
    return pref[r] - pref[l];
}
bool rev = false;
int s[N];
ll res[N];
void dfs(int v) {
    s[v] = 1;
    for(int to:g[v]) {
        dfs(to);
        s[v] += s[to];
    }
    if(rev) {
        res[v] += (s[v] - 1) * 1ll * (v - 1);
    } else {
        res[v] += (s[v] - 1) * 1ll * (n - v );
    }
}
int id[N];
void solve() {
    for(int i = 1;i <= n;i++) {
        g[i].clear();
        rt[i] = 1;
        pref[i] = pref[i - 1] + a[i];
    }
    for(int i = 1,it = 1; i <= n; i++) {
        while(it <= n && cost(i,it  ) <= k) {
            it++;
        }
        if(it <= n) {
            g[id[it - 1]].push_back(id[i]);
            rt[id[i]] = 0;
        }
    }
    for(int i = 1; i <= n; i++) {
        if(rt[i]) {
            dfs(i);
        }
    }
}
int bf[N],pos[N];
vector<pair<int,int>> gr[N];
vector<int> ord;
void go(int v,int pr = -1) {
    ord.push_back(v);
    for(auto [to,w]:gr[v]) {
        if(to != pr) {
            bf[to] = w;
            go(to,v);
        }
    }
}
void test() {
    cin >> n >> k;
    for(int i = 1; i <= n - 1; i++) {
        int x,y,w;
        cin >> x >> y >> w;
        x++;
        y++;
        gr[x].push_back({y,w});
        gr[y].push_back({x,w});
    }
    for(int i = 1;i <= n;i++) {
        if((int)gr[i].size() == 1) {
            go(i);
            break;
        }
    }
    for(int i = 0;i < n;i++) {
        pos[ord[i]] = i + 1;
        a[i + 1] = bf[ord[i]];
    }
    for(int i = 1;i <= n;i++) {
        id[i] = i;
    }
    solve();
    rev = 1;
    reverse(id + 1,id + n + 1);
    reverse(a + 2,a + n + 1);
    solve();
    for(int i = 1; i <= n; i++) {
        cout << res[pos[i]] << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) {
        test();
    }
}