#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<array<int,2>>> a;
vector<vector<int>> dp;
// 0 = node, 1 = miktar;
int k,n;
void dfs(int s,int anne)
{
for(auto i:a[s])
{
int x = i[0];
int val = i[1];
if(x==anne) continue;
dfs(x,s);
for(int mx = k;mx>0;mx--)
{
for(int i = mx-1;i>=0;i--)
{
dp[s][mx] = max(dp[s][mx],dp[s][i]+dp[x][mx-i]+val);
}
}
}
}
/*void df(int s,int anne,int val)
{
ans[s] = f[s];
if(anne!=0)
{
if(ans[anne][0]!=s)
{
if(ans[anne][1]+val>ans[s][1])
{
ans[s] = {anne,ans[anne][1]+val};
}
}
if(f[anne][0]!=s)
{
if(f[anne][1]+val>ans[s][1])
{
ans[s] = {f[anne][0],val+f[anne][1]};
}
}
else
{
if(h[anne]+val>ans[s][1])
ans[s] = {-1,h[anne]+val};
}
}
for(auto i:a[s])
{
int x = i[0];
int v = i[1];
//cout << x << " " << s << " "<< v << endl;
if(x==anne) continue;
df(x,s,v);
}
}*/
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
//int n,k;
cin >> n >> k;
a.resize(n+1);
dp.resize(n+1,vector<int>(k+1,0));
for(int i=0;i<n-1;i++)
{
int u,v,x;
cin >> u >> v >> x;
a[u].push_back({v,x});
a[v].push_back({u,x});
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
for(int t = 0;t<=k;t++) dp[j][t] = 0;
}
dfs(i,0);
cout << *max_element(dp[i].begin(),dp[i].end()) << endl;
}
}
