#include<bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define pb push_back
using namespace std;
const int maxn=4e5;
int N,M;ll K;
ll X[maxn+5],Res[maxn+5];
const ll mod=998244353;
void add(ll &x,const ll y){if((x+=y)>=mod)x-=mod;}
void del(ll &x,const ll y){if((x+=(mod-y))>=mod)x-=mod;}
ll qpow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1ll)res=res*a%mod;
        a=a*a%mod;b>>=1;
    }return res;
}
namespace Poly{
    ll f[2000005],g[2000005],A[2000005],B[2000005],C[2000005];
    int L,limit,r[2000005];
    ll Now[2000005];
    void ntt(int nn,ll *a,int op){
    	limit=1,L=0;while(limit<nn)limit<<=1,++L;
    	for(int i=0;i<limit;++i)r[i]=((r[i>>1]>>1)|((i&1)<<L-1));
        for(int i=0;i<limit;++i)if(i<r[i])swap(a[i],a[r[i]]);
        ll G=(op==1?3ll:332748118);
        for(int mid=1;mid<limit;mid<<=1){
	        ll Wn=qpow(G,(mod-1)/(mid<<1));Now[0]=1;
	        for(int i=1;i<=mid;++i)Now[i]=Now[i-1]*Wn%mod;
	        for(int j=0;j<limit;j+=(mid<<1)){
	            for(int k=0;k<mid;++k){
	                ll x=a[j+k],y=a[j+k+mid]*Now[k]%mod;
	                add(a[j+k],y);a[j+k+mid]=((x<y)?(x+mod-y):(x-y));
	            }
	        }
	    }
	    if(op<0){ll inv=qpow(limit,mod-2);for(int i=0;i<limit;++i)a[i]=a[i]*inv%mod;}
	}
	void getinv(int n,ll *a,ll *b){
		int m=n,now=4*(n+m);for(int i=0;i<=now;++i)g[i]=0,f[i]=a[i];
		int len=1;g[0]=qpow(f[0],mod-2);
		while(len<=n){
			int nn=2*len;
			for(int i=0;i<(len<<2);++i)A[i]=B[i]=0;
			for(int i=0;i<(len<<1);++i)A[i]=f[i],B[i]=g[i];ntt(nn*2,A,1),ntt(nn*2,B,1);
			for(int i=0;i<(len<<2);++i)C[i]=A[i]*B[i]%mod*B[i]%mod;ntt(nn*2,C,-1);
			for(int i=0;i<2*len;++i)C[i]=(2ll*g[i]+mod-C[i])%mod;
			for(int i=0;i<2*len;++i)g[i]=C[i];len<<=1;
		}
		for(int i=0;i<=m;++i)b[i]=g[i];
	}
	ll fa[1000005],fb[1000005],d[1000005];
	void Div(int n,int m,ll *a,ll *b,ll *c){
		for(int i=0;i<=(n<<2);++i)fa[i]=fb[i]=0;
		for(int i=0;i<=n;++i)fa[i]=a[i];
		for(int i=0;i<=m;++i)fb[i]=b[i];
		reverse(fa,fa+n+1);reverse(fb,fb+m+1);int now=n-m;
		for(int i=now+1;i<=n;++i)fa[i]=0;
		for(int i=now+1;i<=m;++i)fb[i]=0;
		getinv(now,fb,fb);
		ntt(2*now+1,fa,1),ntt(2*now+1,fb,1);
		for(int i=0;i<=(now+1<<2);++i)fa[i]=fa[i]*fb[i]%mod;
		ntt(2*now+1,fa,-1);
		for(int i=0;i<=now;++i)d[i]=fa[now-i];
		for(int i=0;i<=(n<<1);++i)fa[i]=fb[i]=0;
		for(int i=0;i<=m;++i)fa[i]=b[i];
		for(int i=0;i<=now;++i)fb[i]=d[i];
		ntt(n+1,fa,1),ntt(n+1,fb,1);
		for(int i=0;i<=(n+1<<1);++i)fa[i]=fa[i]*fb[i]%mod;
		ntt(n+1,fa,-1);
	    for(int i=0;i<=n;++i)fa[i]=(mod+a[i]-fa[i])%mod;
	    for(int i=0;i<m;++i)c[i]=fa[i];
	}
	ll fc[1000005],fd[1000005],fe[1000005];
	vi mul(vi &a,vi &b){
		int len=(int)a.size()+(int)b.size()-1;
		for(int i=0;i<(len<<1);++i)fc[i]=fd[i]=0;
		for(int i=0;i<a.size();++i)fc[i]=a[i];
		for(int i=0;i<b.size();++i)fd[i]=b[i];
		ntt(len,fc,1),ntt(len,fd,1);
		for(int i=0;i<(len<<1);++i)fc[i]=fc[i]*fd[i]%mod;ntt(len,fc,-1);
        vi ans;ans.resize(len);
        for(int i=0;i<len;++i)ans[i]=fc[i];
        return ans;
	}
	int tot;ll Nowx[800005];
	const int S=150;
	vi vec[800005];
	void Mod(vi &a,vi &b){
		int n1=(int)a.size()-1,n2=(int)b.size()-1;n1=max(n1,n2);
		for(int i=0;i<=n1;++i)fc[i]=0;for(int i=0;i<=n2;++i)fd[i]=0;
		for(int i=0;i<a.size();++i)fc[i]=a[i];for(int i=0;i<b.size();++i)fd[i]=b[i];
		Div(n1,n2,fc,fd,fe);a.clear();a.resize(n2);for(int i=0;i<n2;++i)a[i]=fe[i];
	}
	void init(int p,int l,int r){
		if(l==r){vec[p].resize(2);del(vec[p][0],X[l]);add(vec[p][1],1);return;}
		int mid=l+r>>1;init(p<<1,l,mid),init(p<<1|1,mid+1,r);vec[p]=mul(vec[p<<1],vec[p<<1|1]);
	}
	void solve(int p,int l,int r,vi Now){
		if(r-l+1<=S){for(int i=l;i<=r;++i){ll pw=1;for(int j=0;j<Now.size();++j)Res[i]=(Res[i]+Now[j]*pw)%mod,pw=pw*1ll*X[i]%mod;}return;}
		int mid=l+r>>1;Mod(Now,vec[p]);
		solve(p<<1,l,mid,Now),solve(p<<1|1,mid+1,r,Now);
	}
}
#define pii pair<int,ll>
#define fi first
#define se second
#define mp make_pair
ll dis[100005];
int id[100005],ct[100050],sz[100050],mx[100050],rt,mark[100005];
vector<pii>road[100005];
void find(int u,int fa,int act){
	sz[u]=1,mx[u]=0;
	for(auto V:road[u]){
		int v=V.fi;
		if(mark[v]||v==fa)continue;
		find(v,u,act),sz[u]+=sz[v],mx[u]=max(mx[u],sz[v]);
	}mx[u]=max(mx[u],act-sz[u]);
	if(rt==-1||mx[rt]>mx[u])rt=u;
}
void getdis(int u,int fa){
	sz[u]=1;
	for(auto V:road[u]){
		int v=V.fi;
		if(v==fa||mark[v])continue;
		dis[v]=dis[u]+V.se,getdis(v,u),sz[u]+=sz[v];
	}
}
struct Node{ll d;int u;}a[100005],b[100050];
bool operator<(Node a,Node b){return a.d<b.d;} 
int tt,c[100005];
void add(int p,int o){for(int i=p;i<=N;i+=(i&-i))c[i]+=o;}
int qry(int p){
	int ans=0;
	for(int i=p;i;i&=(i-1))ans+=c[i];
	return ans;
}
void Ins(int u,int fa){
	a[++tt]=Node{K-dis[u],u},b[tt]=Node{dis[u],id[u]};
	for(auto v:road[u])if(!mark[v.fi]&&v.fi!=fa)Ins(v.fi,u);
}
void calc(int o){
    sort(a+1,a+tt+1),sort(b+1,b+tt+1);
    memset(c,0,sizeof(c));
    int now=1;
    for(int i=1;i<=tt;++i){
    	while(now<=tt&&b[now].d<=a[i].d)add(b[now++].u,1);
    	ct[a[i].u]+=o*qry(id[a[i].u]-1);
	}
	for(int i=1;i<now;++i)add(b[i].u,-1);
}
void solve(int u,int G){
	rt=-1,find(u,-1,G),u=rt;
	dis[u]=0,getdis(u,-1),mark[u]=1;vector<pii>vec;tt=0;a[++tt]=Node{K,u},b[tt]=Node{0,id[u]};
    for(auto v:road[u])if(!mark[v.fi])vec.pb(mp(v.fi,sz[v.fi])),Ins(v.fi,u);
	calc(1);
    for(auto v:vec)tt=0,Ins(v.fi,u),calc(-1);
    for(auto v:vec)solve(v.fi,v.se);
}
queue<int>q;
ll fac[100005],ifac[100005],f[100005],g[100005];
vi Calc(int l,int r){
	if(l==r){
		vi now;now.resize(2);
		now[1]=1,now[0]=mod-ct[l];
		return now;
	}
	int mid=l+r>>1;
	vi lf=Calc(l,mid),rg=Calc(mid+1,r);
	return Poly::mul(lf,rg);
}
ll C(int n,int m){
	return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
Node p[100005];
int main(){
	scanf("%d%lld",&N,&K);--K;
	for(int i=1;i<N;++i){
		int u,v;ll w;
		scanf("%d%d%lld",&u,&v,&w);
		road[u].pb(make_pair(v,w));
		road[v].pb(make_pair(u,w));
	}
	q.push(1);int tt=0;
	getdis(1,0);
	for(int i=1;i<=N;++i)p[i].d=dis[i],p[i].u=i;
	sort(p+1,p+N+1);
	for(int i=1;i<=N;++i)id[p[i].u]=i;
    solve(1,N);int mx=0;fac[0]=ifac[0]=1;M=N;
    for(int i=1;i<=N;++i)mx=max(mx,ct[i]),fac[i]=1ll*i*fac[i-1]%mod,ifac[i]=qpow(fac[i],mod-2),X[i]=i;
    Poly::init(1,1,M),Poly::solve(1,1,M,Calc(1,N));
    for(int i=1;i<=N;++i)f[i]=Res[i],f[i]=((i>=mx)?f[i]:0ll);
    vi a,b,c;a.resize(N+1),b.resize(N+1);
    for(int i=1;i<=N;++i)a[i]=f[i]*ifac[i]%mod;
    for(int i=0;i<=N;++i){
    	if(i&1)b[i]=mod-ifac[i];
    	else b[i]=ifac[i];
	}
	c=Poly::mul(a,b);
    for(int i=1;i<=N;++i)printf("%lld ",c[i]);
	return 0;
}