#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 7e4 + 5;

int n, k;
int sz[kMaxN];
int64_t ans[kMaxN];
std::vector<std::pair<int, int>> G[kMaxN];

void dfs1(int u, int fa) {
  sz[u] = 1;
  for (auto [v, w] : G[u]) {
    if (v == fa) continue;
    dfs1(v, u);
    sz[u] += sz[v];
  }
}

void dfs2(int u, int fa, int rem) {
  for (auto [v, w] : G[u]) {
    if (v == fa) continue;
    if (rem < w) ans[u] += sz[v], dfs2(v, u, k - w);
    else dfs2(v, u, rem - w);
  }
}

void dickdreamer() {
  std::cin >> n >> k;
  for (int i = 1; i < n; ++i) {
    int u, v, w;
    std::cin >> u >> v >> w;
    ++u, ++v;
    G[u].emplace_back(v, w), G[v].emplace_back(u, w);
  }
  for (int i = 1; i <= n; ++i) dfs1(i, 0), dfs2(i, 0, k);
  for (int i = 1; i <= n; ++i) std::cout << ans[i] << '\n';
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}