#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define conts continue
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &x, T y){
x = min(x,y);
}
template<typename T>
void amax(T &x, T y){
x = max(x,y);
}
template<typename A,typename B>
string to_string(pair<A,B> p);
string to_string(const string &s){
return "'"+s+"'";
}
string to_string(const char *s){
return to_string((string)s);
}
string to_string(bool b){
return b?"true":"false";
}
template<typename A>
string to_string(A v){
string res = "{";
trav(x,v){
res += to_string(x)+",";
}
if(res.back() == ',') res.pop_back();
res += "}";
return res;
}
template<typename A,typename B>
string to_string(pair<A,B> p){
return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}
#define debug(x) cout << #x << " = "; cout << to_string(x) << endl
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;
const int K = 15;
vector<pll> adj[N];
ll dp1[N][K], dp2[N][K];
void solve(int test_case){
ll n,k; cin >> n >> k;
rep(i,n-1){
ll u,v,w; cin >> u >> v >> w;
adj[u].pb({v,w}), adj[v].pb({u,w});
}
vector<ll> ans(n);
vector<ll> subsiz(n);
auto dfs1 = [&](ll u, ll p, auto &&dfs1) -> void{
subsiz[u] = 1;
rep(j,k+1) dp1[u][j] = 0;
dp1[u][k] = 1;
for(auto [v,w] : adj[u]){
if(v == p) conts;
dfs1(v,u,dfs1);
subsiz[u] += subsiz[v];
rep(j,k+1){
if(j >= w){
dp1[u][j-w] += dp1[v][j];
}
else{
dp1[u][k-w] += dp1[v][j];
}
}
}
};
rep(u,n){
dfs1(u,-1,dfs1);
for(auto [v,w] : adj[u]){
rep(j,k+1){
if(j >= w){
dp1[u][j-w] -= dp1[v][j];
}
else{
dp1[u][k-w] -= dp1[v][j];
}
}
ll sum = 0;
rep(j,w){
sum += dp1[u][j];
}
ans[u] += sum*subsiz[v];
rep(j,k+1){
if(j >= w){
dp1[u][j-w] += dp1[v][j];
}
else{
dp1[u][k-w] += dp1[v][j];
}
}
}
}
rep(i,n) cout << ans[i] << endl;
}
int main(){
int t = 1;
// cin >> t;
rep1(i,t){
solve(i);
}
return 0;
}
