#include <bits/stdc++.h>
using namespace std;
struct edge {
int u, v, c;
int other(int w) {
return u ^ v ^ w;
}
};
struct SEG_TREE {
long long ls, rs;
int root;
vector<long long> segTree;
vector<int> leftSon, rightSon;
int createNode() {
int v = segTree.size();
segTree.push_back(0);
leftSon.push_back(-1);
rightSon.push_back(-1);
return v;
}
void init(long long l, long long r) {
ls = l;
rs = r;
segTree.clear();
leftSon.clear();
rightSon.clear();
root = createNode();
}
void update(int v, long long l, long long r, long long p, long long x) {
if (l == r) {
segTree[v] += x;
return;
}
long long mid = (l + r) / 2;
if (p <= mid) {
if (leftSon[v] == -1)
leftSon[v] = createNode();
update(leftSon[v], l, mid, p, x);
} else {
if (rightSon[v] == -1)
rightSon[v] = createNode();
update(rightSon[v], mid + 1, r, p, x);
}
segTree[v] = (leftSon[v] == -1 ? 0 : segTree[leftSon[v]]) +
(rightSon[v] == -1 ? 0 : segTree[rightSon[v]]);
}
long long query(int v, long long l, long long r, long long lq, long long rq) {
if (v == -1)
return 0;
if (l > rq || r < lq)
return 0;
if (lq <= l && r <= rq)
return segTree[v];
long long mid = (l + r) / 2;
return query(leftSon[v], l, mid, lq, rq) + query(rightSon[v], mid + 1, r, lq, rq);
}
void modify(long long p, int x) {
assert(ls <= p && p <= rs);
update(root, ls, rs, p, x);
}
long long countLower(long long p) {
assert(ls <= p && p <= rs);
p--;
return query(root, ls, rs, 0, p);
}
};
const int MAX_N = 7e4;
int n, k;
long long ans[MAX_N];
bool isCentroid[MAX_N];
int sizee[MAX_N], starts[MAX_N];
long long depth[MAX_N];
int remUp[MAX_N];
edge edges[MAX_N];
vector<int> adj[MAX_N];
SEG_TREE frecv;
void calcSizes(int u, int p) {
sizee[u] = 1;
for (int e: adj[u]) {
int v = edges[e].other(u);
if (v == p || isCentroid[v])
continue;
calcSizes(v, u);
sizee[u] += sizee[v];
}
}
int totsz, centroid;
void findCentroid(int u, int p) {
int maxsz = totsz - sizee[u];
for (int e: adj[u]) {
int v = edges[e].other(u);
if (v == p || isCentroid[v])
continue;
findCentroid(v, u);
maxsz = max(maxsz, sizee[v]);
}
if (maxsz <= totsz / 2)
centroid = u;
}
vector<int> vert, st, vertBySubtree[MAX_N];
void calcUp(int u, int p, int w) {
if (p != -1 && w == -1)
w = u;
vert.push_back(u);
st.push_back(u);
if (p != -1)
vertBySubtree[w].push_back(u);
int l = -1, r = st.size() - 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (depth[u] - depth[st[mid]] <= k)
r = mid;
else
l = mid;
}
remUp[u] = (r == 0 ? k - depth[u] : remUp[st[r]]);
sizee[u] = 1;
for (int e: adj[u]) {
int v = edges[e].other(u);
if (v == p || isCentroid[v])
continue;
depth[v] = depth[u] + edges[e].c;
calcUp(v, u, w);
sizee[u] += sizee[v];
}
if (r != 0)
starts[st[r]] += starts[u] + 1;
st.pop_back();
}
void calcDown(int u, int p) {
long long st = frecv.countLower(depth[u]) - frecv.countLower(depth[p]);
ans[p] += st * sizee[u];
frecv.modify(k + depth[p], st);
for (int e: adj[u]) {
int v = edges[e].other(u);
if (v == p || isCentroid[v])
continue;
calcDown(v, u);
}
frecv.modify(k + depth[p], -st);
}
void decomp(int r) {
calcSizes(r, -1);
totsz = sizee[r];
findCentroid(r, -1);
int c = centroid;
calcUp(c, -1, -1);
for (int e: adj[c]) {
int w = edges[e].other(c);
if (isCentroid[w])
continue;
for (int v: vertBySubtree[w])
ans[v] += (long long)(sizee[c] - sizee[w]) * starts[v];
}
frecv.init(0, (long long)sizee[c] * k);
for (int v: vert)
frecv.modify(remUp[v], 1);
for (int e: adj[c]) {
int w = edges[e].other(c);
if (isCentroid[w])
continue;
for (int v: vertBySubtree[w])
frecv.modify(remUp[v], -1);
calcDown(w, c);
for (int v: vertBySubtree[w])
frecv.modify(remUp[v], 1);
}
for (int v: vert) {
starts[v] = sizee[v] = depth[v] = 0;
vertBySubtree[v].clear();
}
vert.clear();
isCentroid[c] = true;
for (int e: adj[c]) {
int w = edges[e].other(c);
if (isCentroid[w])
continue;
decomp(w);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
for (int e = 0; e < n - 1; e++) {
cin >> edges[e].u >> edges[e].v >> edges[e].c;
adj[edges[e].u].push_back(e);
adj[edges[e].v].push_back(e);
}
decomp(0);
for (int v = 0; v < n; v++)
cout << ans[v] << "\n";
return 0;
}
