#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../Library/debug.h"
#else
#define dbg(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define FORd(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define F0Rd(i, a) for (int i = (a) - 1; i >= 0; --i)
#define trav(a, x) for (auto& a : x)
#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
const char nl = '\n';
const int INF = 1e9;
const int MOD = 1e9 + 7;
void solve(){
int n,k;
cin>>n>>k;
vector<vi> adj(n);
vector<array<int,2>> e(n-1);
F0R(i,n-1){
int a,b,c;
cin>>a>>b>>c;
e[i]={a^b,c};
adj[a].pb(i);
adj[b].pb(i);
}
vi ans(n);
vector<array<int,12>> dp(n);
auto dfs=[&](auto self, int v, int p)->void{
trav(id,adj[v]){
int u=e[id][0]^v;
if(u==p)continue;
self(self,u,v);
int w=e[id][1];
F0R(i,12){
if(i-w<0){
ans[u]+=dp[u][i];
dp[v][k-w]+=dp[u][i];
}
else dp[v][i-w]+=dp[u][i];
}
}
dp[v][k]++;
};
F0R(i,n){
F0R(j,n)F0R(ii,12)dp[j][ii]=0;
dfs(dfs,i,-1);
}
trav(i,ans)cout<<i<<" ";
cout<<nl;
}
int32_t main(){
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int TC = 1;
// cin >> TC;
while(TC--){
solve();
}
return 0;
}
