#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5,mod=998244353;
int c,T,n,p[N],l[N],r[N],h[N],lim[N],w[N],f[17][N],st[17][N],dep[N],dp[N],sum[N],dfn[N],tot,sz[N],tree[N];
vector<int>e[N];
vector<tuple<int,int,int>>g[N];
void dfs(int x)
{
	f[0][x]=p[x],dfn[x]=++tot,sz[x]=1;w[tot]=x;
	for(int i=1;i<17;i++)f[i][x]=f[i-1][f[i-1][x]];
	for(auto y:e[x])dep[y]=dep[x]+1,dfs(y),sz[x]+=sz[y];
}
void change(int x,int y)
{
	if(!x)return;
	for(;x<=n;x+=x&-x)tree[x]=(tree[x]+y)%mod;
}
int solve(int x)
{
	int res=0;
	for(;x;x-=x&-x)res=(res+tree[x])%mod;
	return res;
}
void dfs2(int x)
{
	if(x!=1)
	{
		dp[x]=(solve(dfn[x]+sz[x]-1)-solve(dfn[x]-1))%mod;
		sum[x]=(sum[p[x]]+dp[x])%mod;
	}
	for(auto y:g[x])
	{
		int tmp1,tmp2,op;tie(tmp1,tmp2,op)=y;
		change(dfn[tmp2],1ll*op*sum[x]%mod),change(dfn[tmp1],1ll*(mod-op)*sum[x]%mod);
	}
	for(auto y:e[x])dfs2(y);
}
int Get(int x,int y)
{
	for(int i=16;i>=0;i--)if(st[i][x]>=y)x=f[i][x];
	return x;
}
int Get2(int x,int y)
{
	for(int i=16;i>=0;i--)if(y&(1<<i))x=f[i][x];
	return x;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>c>>T;
	while(T--)
	{
		cin>>n,tot=0;
		for(int i=1;i<=n;i++)sum[i]=tree[i]=0,e[i].clear(),g[i].clear();
		for(int i=2;i<=n;i++)
		{
			cin>>p[i]>>l[i]>>r[i]>>h[i];
			e[p[i]].emplace_back(i);
		}
		dfs(1),lim[1]=st[0][1]=-1;
		for(int i=2;i<=n;i++)
		{
			l[i]=dep[i]-l[i],r[i]=dep[i]-r[i];
			swap(l[i],r[i]),lim[i]=st[0][i]=dep[i]-h[i]-1;
		}
		for(int i=1;i<17;i++)
		{
			for(int j=1;j<=n;j++)st[i][j]=min(st[i-1][j],st[i-1][f[i-1][j]]);
		}
		for(int i=2;i<=n;i++)
		{
			int x=Get(i,l[i]-1),y=Get2(i,dep[i]-(l[i]-1));
			g[y].emplace_back(x,i,-1);
			int xx=Get(i,r[i]),yy=Get2(i,dep[i]-r[i]);
			g[yy].emplace_back(xx,i,1),sum[xx]++,sum[x]--;
		}
		for(int i=n;i>1;i--)
		{
			int x=w[i],y=Get(x,lim[x]),z=Get2(x,dep[x]-lim[x]);
			g[z].emplace_back(y,x,sum[x]),sum[y]+=sum[x];
		}
		memset(dp,0,sizeof(dp)),dp[1]=sum[1]=1,dfs2(1);
		for(int i=2;i<=n;i++)cout<<(dp[i]+mod)%mod<<' ';
		cout<<'\n';
	}
	return 0;
}