#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define mkp make_pair
#define pb push_back
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 300005
#define inf 0x3f3f3f3f
#define ll long long

int n,k,fa[maxn];
vector<pii>e[maxn];

ll d[maxn];

int tr[maxn];
void add(int x,int y){
	for(;x<=n;x+=x&-x)tr[x]+=y;
}
int ask(int x){
	int res=0;
	for(;x;x^=x&-x)res+=tr[x];
	return res;
}

int getf(int u){
	while(u^fa[u])u=fa[u]=fa[fa[u]];
	return u;
}
void merge(int u,int v,int w){
	u=getf(u),v=getf(v);
	if(u>v)swap(u,v);
	fa[v]=u;
	add(v,-1);
	int l=v,r=n,p=l;
	while(l<=r){
		int mid=l+r>>1;
		if(ask(mid)>k)r=mid-1,p=mid;
		else l=mid+1;
	}
	d[v]+=n;
	d[l]-=n;
	d[v]-=w;
	d[l]+=w;
}

signed main()
{
	n=read(),k=read();
	For(i,1,n)fa[i]=i,add(i,1);
	For(i,2,n){
		int u=read(),v=read(),w=read();
		e[w].pb(mkp(u,v));
	}
	For(i,0,n-1)for(auto t:e[i])merge(t.fi,t.se,i);
	For(i,1,n){
		d[i]+=d[i-1];
		printf("%lld\n",1ll*n*k-1ll*n*max(0,k-i+1)-d[i]);
	}
	return 0;
}