#include <bits/stdc++.h>
#define pii pair<int,int>
#define s1 first
#define s2 second
#define N 100011
#define M N*100
using namespace std;
int t,n;const int p=998244353;
vector<int> G[N];
vector<pii> E[M];
vector<int> anc;
int sz;
int lc[M],rc[M],sum[M];
void insert(int u,int v,int w){/*printf("%d %d %d\n",u,v,w);*/if(w)E[v].push_back({u,w});}
void pushup(int x){sum[x]=sum[lc[x]]+sum[rc[x]];}
int merge(int x,int y,int L,int R)
{//printf("merge(%d,%d,[%d,%d])\n",x,y,L,R);
	if(!x||!y)return x^y;
	if(L==R){int z=++sz;lc[z]=rc[z]=0;sum[z]=sum[x]+sum[y];insert(z,n+anc[L],sum[z]);return z;}
	int z=++sz;lc[z]=rc[z]=sum[z]=0;
	lc[z]=merge(lc[x],lc[y],L,L+R>>1);if(lc[z])insert(z,lc[z],1);
	rc[z]=merge(rc[x],rc[y],(L+R>>1)+1,R);if(rc[z])insert(z,rc[z],1);
	pushup(z);return z;
}
int query(int l,int r,int L,int R,int x)
{
	if(!x)return 0;
	if(l<=L&&R<=r)return sum[x];int ans=0;
	if(l<=L+R>>1)ans+=query(l,r,L,L+R>>1,lc[x]);if(r>L+R>>1)ans+=query(l,r,(L+R>>1)+1,R,rc[x]);return ans;
}
void add(int k,int v,int L,int R,int x,int &c)
{
	if(k<L||k>R||!v)return;
	c=++sz;lc[c]=lc[x];rc[c]=rc[x];sum[c]=sum[x];//printf("add(%d,%d,[%d,%d],%d,%d)\n",k,v,L,R,x,c);
	if(L==R){sum[c]+=v;insert(c,n+anc[L],sum[c]);return;}
	if(k<=L+R>>1)add(k,v,L,L+R>>1,lc[x],lc[c]);
	else add(k,v,(L+R>>1)+1,R,rc[x],rc[c]);
	if(lc[c])insert(c,lc[c],1);
	if(rc[c])insert(c,rc[c],1);
	pushup(c);
}
int prune(int x,int k,int L,int R)
{//printf("prune(%d,%d,[%d,%d])\n",x,k,L,R);
	if(k<L)return 0;
	if(k>=R)return x;
	if(!x||L==R)return x;
	int z=++sz;lc[z]=rc[z]=0;
	if(k<=L+R>>1)lc[z]=prune(lc[x],k,L,L+R>>1);
	else lc[z]=lc[x],rc[z]=prune(rc[x],k,(L+R>>1)+1,R);pushup(z);
	return z;
}
void print(int u,int x,int L,int R)
{
	if(!x)return;
	if(L==R){printf("node %d to anc %d w:%d\n",u,anc[L],sum[x]);return;}
	print(u,rc[x],(L+R>>1)+1,R);
	print(u,lc[x],L,L+R>>1);
}
int l[N],r[N],h[N],fa[N],dep[N],rt[N];
void dfs(int u,int F)
{//printf("=============dfs(%d,%d)\n",u,F);
	anc.push_back(u);
	dep[u]=dep[F]+1;
	if(F)insert(n+u,n+F,1);//,printf("%d %d %d\n",n+F,n+u,1);
	insert(n+u,u,1);
	for(int v:G[u])if(v^F)
	{
		dfs(v,u);//printf("merge %d->%d\n",v,u);
		rt[u]=merge(rt[u],rt[v],0,n);
		// printf("rt[%d]:%d\n",u,rt[u]);
	}
	// print(u,rt[u],0,n);
	int sp=query(dep[u]-h[u],n,0,n,rt[u]);//printf("sp:%d\n",sp);
	rt[u]=prune(rt[u],dep[u]-h[u]-1,0,n);
	add(dep[u]-h[u]-1,sp,0,n,rt[u],rt[u]);
	int L=dep[u]-r[u],R=min(dep[u]-l[u],dep[u]-h[u]-1);
	// printf("u:%d able dep:[%d,%d] sp:%d rt:%d\n",u,L,R,sp,rt[u]);
	// printf("after merge:\n");
	// print(u,rt[u],0,n);
	if(L<=R)
	{
		add(L-1,-1,0,n,rt[u],rt[u]);
		add(R,1,0,n,rt[u],rt[u]);
	}
	if(!rt[u])rt[u]=++sz,lc[rt[u]]=rc[rt[u]]=sum[rt[u]]=0;
	insert(u,rt[u],1);
	// print(u,rt[u],0,n);
	// printf("final root of %d: %d\n",u,rt[u]);
	anc.pop_back();
}
int in[M],f[M];
queue<int> q;
int main()
{
	scanf("%*d%d",&t);while(t--)
	{//printf("==============================================================================================\n");
		scanf("%d",&n);
		for(int i=1;i<=n;++i)G[i].clear(),rt[i]=0;
		for(int i=0;i<=sz;++i)E[i].clear(),in[i]=0,f[i]=0;sz=2*n;
		dep[0]=-1;
		for(int i=2;i<=n;++i)
		{
			scanf("%d%d%d%d",fa+i,l+i,r+i,h+i);G[fa[i]].push_back(i);
		}
		dfs(1,0);
		for(int i=1;i<=sz;++i)for(auto [v,w]:E[i])++in[v];
		while(!q.empty())q.pop();
		for(int i=1;i<=sz;++i)if(!in[i])q.push(i);
		f[1]=1;
		while(!q.empty())
		{
			int u=q.front();q.pop();//printf("====u:%d f:%d\n",u,f[u]);
			for(auto [v,w]:E[u])
			{
				// printf("%d<-%d %d\n",u,v,w);
				f[v]=(f[v]+1ll*w*f[u])%p;
				if(!--in[v])q.push(v);
			}
		}
		// printf("f:");for(int i=1;i<=sz;++i)printf("%d ",f[i]);putchar(10);
		for(int i=2;i<=n;++i)printf("%d ",(f[i]%p+p)%p);putchar(10);
		// printf("sz:%d\n",sz);
	}
	fclose(stdin);fclose(stdout);return 0;
}