#include<stdio.h>
#include<vector>
const int mod=998244353;
int sum(int a,int b){return a<mod-b?a+b:a-(mod-b);}
int dif(int a,int b){return a<b?mod-(b-a):a-b;}
int pro(int a,int b){return (long long)a*b%mod;}
std::vector<int>ch1[100001],ch2[100001],in[100001],out[100001];
int n,p[100001],l[100001],r[100001],h[100001],d[100001],dfn1[100001],dfn2[100001],end1[100001],end2[100001];
int f[100001],g[100001];
int c1[100001],c2[100001],c3[100001];
int query1(int x){
	int s=0;
	for(;x;x-=(x&-x))s+=c1[x];
	return s;
}
void change1(int x,int k){
	for(;x<=n;x+=(x&-x))c1[x]+=k;
}
int query2(int x){
	int s=0;
	for(;x;x-=(x&-x))s=sum(s,c2[x]);
	return s;
}
void change2(int x,int k){
	for(;x<=n;x+=(x&-x))c2[x]=sum(c2[x],k);
}
int query3(int x){
	int s=0;
	for(;x;x-=(x&-x))s+=c3[x];
	return s;
}
void change3(int x,int k){
	for(;x<=n;x+=(x&-x))c3[x]+=k;
}
namespace init1{
	int dfntot;
	void dfs(int u){
		dfn1[u]=++dfntot;
		for(const auto&v:ch1[u])dfs(v);
		end1[u]=dfntot;
	}
	void work(){
		for(int i=1;i<=n;++i)ch1[i].clear();
		d[1]=1,h[1]=0;
		for(int i=2;i<=n;++i)ch1[p[i]].push_back(i),d[i]=d[p[i]]+1,h[i]=d[i]-h[i]-1,l[i]=d[i]-l[i],r[i]=d[i]-r[i];
		dfntot=0,dfs(1);
	}
}
namespace init2{
	int stk[100001],dfntot;
	void dfs1(int u,int m){
		int t=stk[m],p,q,x;
		stk[m]=u;
		if(u>1&&r[u]<=h[u]){
			for(p=1,q=m;p<q;){
				x=p+q+1>>1;
				if(r[u]>h[stk[x]])p=x;
				else q=x-1;
			}in[stk[p+1]].push_back(u);
		}
		if(u>1&&l[u]<=h[u]){
			for(p=1,q=m;p<q;){
				x=p+q+1>>1;
				if(l[u]>h[stk[x]])p=x;
				else q=x-1;
			}out[stk[p+1]].push_back(u);
		}
		for(const auto&v:ch1[u]){
			for(p=1,q=m;p<q;){
				x=p+q+1>>1;
				if(h[stk[x]]<h[v])p=x;
				else q=x-1;
			}ch2[stk[p]].push_back(v),dfs1(v,p+1);
		}
		stk[m]=t;
	}
	void dfs2(int u){
		dfn2[u]=++dfntot;
		for(const auto&v:ch2[u])dfs2(v);
		end2[u]=dfntot;
	}
	void work(){
		for(int i=1;i<=n;++i)ch2[i].clear(),in[i].clear(),out[i].clear();
		dfs1(1,1);
		dfntot=0,dfs2(1);
	}
}
void dfs(int u){
	for(const auto&v:in[u])change1(dfn2[v],1),change2(dfn1[v],dif(0,g[r[v]-1])),change2(dfn1[query3(dfn2[v])],g[h[query3(dfn2[v])]]);
	for(const auto&v:out[u])change1(dfn2[v],-1),change2(dfn1[v],g[l[v]]),change2(dfn1[query3(dfn2[v])],dif(0,g[h[query3(dfn2[v])]]));
	g[d[u]]=sum(g[d[u]-1],f[u]=u>1?dif(query2(end1[u]),query2(dfn1[u]-1)):1);
	for(const auto&v:ch2[u])
		change2(dfn1[v],pro(dif(query1(end2[v]),query1(dfn2[v]-1)),g[h[v]])),change3(dfn2[v],v-u),change3(end2[v]+1,u-v);
	for(const auto&v:ch1[u])dfs(v);
}
void work(){
	scanf("%d",&n);
	for(int i=2;i<=n;++i)scanf("%d%d%d%d",p+i,l+i,r+i,h+i);
	init1::work(),init2::work();
	for(int i=1;i<=n;++i)c1[i]=c2[i]=0,c3[i]=i==(i&-i);
	dfs(1);
	for(int i=2;i<=n;++i)printf("%d ",f[i]);
	puts("");
}
int main(){
	int t;
	for(scanf("%*d%d",&t);t--;work());
	return 0;
}