#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int NN=998244353;
int dfn[100100],st[20][100100];
int dep[100100],dis[100100];
vector<pair<int,int> >g[100100];
int id[100100],f[100100],ct[100100],tot;

int p[100100],ni[100100];
int mi(int x,int y){
    int sum=1;
    for (;y;y>>=1,x=x*x%NN)
    if(y&1)sum=sum*x%NN;
    return sum;
}
int n,k;
void dfs(int x,int pa){
    dfn[x]=++tot;st[0][tot]=pa;
    for(auto i:g[x]){
        int y=i.first,z=i.second;
        if(y!=pa){
            dis[y]=dis[x]+z;
            dep[y]=dep[x]+1;
            dfs(y,x);
        }
    }
}
int demin(int x,int y){
    return (dep[x]<dep[y])?x:y;
}
int glca(int x,int y){
    if(x==y)return x;
    x=dfn[x],y=dfn[y];
    if(x>y)swap(x,y);
    int tmp=__lg(y-x);
    return demin(st[tmp][x+1],st[tmp][y-(1<<tmp)+1]);
}
int ds(int x,int y){
    return dis[x]+dis[y]-2*dis[glca(x,y)];
}
void init(){
    for (int i=1;i<=__lg(n);i++)
    for (int j=1;j+(1<<i)-1<=n;j++)
    st[i][j]=demin(st[i-1][j],st[i-1][j+(1<<i-1)]);
}
bool cmp(int x,int y){
    return dis[x]<dis[y];
}
int c(int x,int y){
    if(x<0||y<0||x<y)return 0;
    return p[x]*ni[y]%NN*ni[x-y]%NN;
}
signed main(){
    cin>>n>>k;
    for (int i=1,x,y,z;i<n;i++)
    cin>>x>>y>>z,
    g[x].push_back({y,z}),
    g[y].push_back({x,z});
    dfs(1,1);
    init();
    p[0]=1;
    for (int i=1;i<=n;i++)
    p[i]=p[i-1]*i%NN;
    ni[n]=mi(p[n],NN-2);
    for (int i=n;i;i--)
    ni[i-1]=ni[i]*i%NN;
    for (int i=1;i<=n;i++)
    id[i]=i;
    sort(id+1,id+n+1,cmp);
    for (int i=1;i<=n;i++){
        for(int j=1;j<i;j++)
        if(ds(id[i],id[j])<k)ct[i]++;
        // cout<<i<<"@@@"<<ct[i]<<"\n";
    }
    for (int i=0;i<=n;i++){
        f[i]=1;
        for (int j=1;j<=n;j++)
        f[i]=f[i]*(i-ct[j])%NN;
    // cout<<i<<"!!!"<<f[i]<<"\n";
    }
    for (int i=1;i<=n;i++){
        for (int j=0;j<i;j++){
            f[i]=(f[i]-c(i,j)*f[j])%NN;
        }
        f[i]=(f[i]+NN)%NN;
        // cout<<sum<<"~~~~\n";
        cout<<f[i]*ni[i]%NN<<" ";
    }
    cout<<"\n";
}