#include<bits/stdc++.h>
using namespace std;
char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?EOF:*p1++)
template<class rd>
void read(rd &x){
	char c=getchar();
	for(;c<48||c>57;c=getchar());
	for(x=0;c>47&&c<58;c=getchar())x=(x<<1)+(x<<3)+(c^48);
}
const int N=1e5+5,P=998244353,M=N*50;
int tid,T,n,p[N],l[N],r[N],h[N],w[N],ans,f[N],dp[N],rp[N];
int rt[N],ls[M],rs[M],cv[M],sum[M],va[M],cnt,tp;
bool vis[M],dl[M];
vector<int>e[N];
struct rb{
	int ty,x,y;
}st[M<<2];
inline int md(int x){
	return x>=P?x-P:x;
}
inline void Add(int &x,int y){
	if((x+=y)>=P)x-=P;
}
inline void chg(int k,int v){
	st[++tp]=rb{1,k,cv[k]};
	cv[k]=v,dl[k]=false;;
}
inline void mer(int x,int y){
	st[++tp]=rb{2,x,y};
	cv[x]+=cv[y],dl[x]=false;
}
inline void mdf(int k,int x,int y){
	cv[k]=x,va[k]=y,vis[k]=false;
}
inline void pushup(int k){
	sum[k]=(va[k]&&cv[k])?(sum[ls[k]]+sum[rs[k]]+1ll*va[k]*cv[k])%P:md(sum[ls[k]]+sum[rs[k]]);
}
void modify(int &k,int l,int r,int x,int y){
	if(!k)k=++cnt;
	if(x<=l&&r<=y)return chg(k,cv[k]+1);
	int mid=l+r>>1;
	if(x<=mid)modify(ls[k],l,mid,x,y);
	if(y>mid)modify(rs[k],mid+1,r,x,y);
}
void mark(int k,int l,int r,int x,int y){
	vis[k]=false;
	if(x<=l&&r<=y)return;
	int mid=l+r>>1;
	if(x<=mid)mark(ls[k],l,mid,x,y);
	if(y>mid)mark(rs[k],mid+1,r,x,y);
}
int merge(int x,int y,int l,int r){
	if(!x||!y)return x|y;
	if(l==r){
		mer(x,y);
		return x;
	}
	int mid=l+r>>1;
	mer(x,y);
	ls[x]=merge(ls[x],ls[y],l,mid);
	rs[x]=merge(rs[x],rs[y],mid+1,r);
	return x;
}
void clear(int &k,int l,int r,int p){
	if(!k||dl[k])return;
	if(l>=p){
		chg(k,0);
		if(l==r)return;
		int mid=l+r>>1;
		clear(ls[k],l,mid,p);
		clear(rs[k],mid+1,r,p);
		dl[k]=true;
		return;
	}
	int mid=l+r>>1;
	if(!ls[k])ls[k]=++cnt;
	if(p>mid&&!rs[k])rs[k]=++cnt;
	chg(ls[k],cv[ls[k]]+cv[k]);
	if(p>mid)chg(rs[k],cv[rs[k]]+cv[k]);
	chg(k,0);
	clear(rs[k],mid+1,r,p);
	if(p<=mid)clear(ls[k],l,mid,p);
}
void ins(int k,int l,int r,int x,int v){
	if(!k)return;
	mdf(k,cv[k],md(va[k]+v));
	if(l==r)return;
	int mid=l+r>>1;
	if(x<=mid)ins(ls[k],l,mid,x,v);
	else ins(rs[k],mid+1,r,x,v);
}
void restore(int o){
	while(tp>o){
		int x=st[tp].x,y=st[tp].y;
		if(st[tp].ty==2)mdf(y,cv[y],va[x]),mdf(x,cv[x]-cv[y],va[x]);
		else mdf(x,y,va[x]);
		--tp;
	}
}
void dfs1(int x){
	for(auto v:e[x])dfs1(v);
	rp[x]=tp;
	for(auto v:e[x])rt[x]=merge(rt[x],rt[v],0,n-1);
	modify(rt[x],0,n-1,dp[x]-r[x],dp[x]-l[x]);
	clear(rt[x],0,n-1,dp[x]-h[x]);
}
void dfs3(int x){
	if(!x||vis[x])return;
	vis[x]=true;
	dfs3(ls[x]),dfs3(rs[x]);
	pushup(x);
}
void dfs2(int x){
	if(x==1)f[x]=1;
	else dfs3(rt[x]),f[x]=sum[rt[x]];
	ins(rt[x],0,n-1,dp[x],f[x]);
	mark(rt[x],0,n-1,dp[x]-r[x],dp[x]-l[x]);
	restore(rp[x]);
	reverse(e[x].begin(),e[x].end());
	for(auto v:e[x])dfs2(v);
}
void solve(){
	read(n);
	for(int i=1;i<=n;++i)e[i].clear(),rt[i]=0;
	for(int i=1;i<=cnt;++i)ls[i]=rs[i]=cv[i]=va[i]=sum[i]=vis[i]=dl[i]=0;
	cnt=tp=0;
	for(int i=2;i<=n;++i){
		read(p[i]),read(l[i]),read(r[i]),read(h[i]);
		e[p[i]].push_back(i);
		dp[i]=dp[p[i]]+1;
	}
	dfs1(1);
	dfs2(1);
	for(int i=2;i<=n;++i)printf("%d%c",f[i]," \n"[i==n]);
}
int main(){
	read(tid),read(T);
	while(T--)solve();
	return 0;
}