#include<bits/stdc++.h>
#define ll long long
//#define int long long
#define ci const int
#define rg int
#define ld long double
#define ls (x<<1)
#define rs (x<<1)|1
#define mid ((l+r)>>1)
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define gcd __gcd
#define P(x) __builtin_popcountll(x)
#define W(x) __builtin_ctzll(x)
#define lowbit(x) (x&-x)
using namespace std;
ci N=1e6+5,mod=998244353; 
const ll inf=1e18;
inline ll read(){ll u,f=1;char o;while((o=getchar())<48||o>57)if(o==45)f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
ll n,m,s;
struct BIT
{
	ll dfn[N],ed[N],tree[N];
	vector<ll>w[N];
	void add(int x,ll v)
	{if(x==0)return;
//		cout<<x<<' '<<v<<'\n';
		for(rg i=x;i<=n;i+=lowbit(i))tree[i]=(tree[i]+v)%mod;
	}
	ll cha(int x)
	{
		ll q=0;
		for(rg i=x;i;i-=lowbit(i))q=(q+tree[i])%mod;
		return q;
	}
}t1,t2;
ll ceng[N],last[N],l[N],r[N],lim[N],f[N],qz[N],to[N],use[N],seg[N];
ll lca[N][20],zhi[N][20];
vector<ll>ch1[N],ch2[N],ch3[N];
struct node
{
	ll id,tp;
};
vector<node>add[N];
void clear()
{
	fo(i,1,n)vector<ll>().swap(t1.w[i]);
	fo(i,1,n)vector<ll>().swap(t2.w[i]);
	fo(i,1,n)vector<ll>().swap(ch1[i]);
	fo(i,1,n)vector<ll>().swap(ch2[i]);
	fo(i,1,n)vector<ll>().swap(ch3[i]);
	fo(i,1,n)vector<node>().swap(add[i]);
	memset(use,0,sizeof(use));
	memset(qz,0,sizeof(qz));
	memset(t1.tree,0,sizeof(t1.tree));
	memset(t2.tree,0,sizeof(t2.tree));
}
void dfs(int x,int c)
{
	ceng[x]=c;
	last[c]=x;
	t1.dfn[x]=++s;
	if(x!=1)
	{
		lim[x]=c-lim[x]-1;
		int L=ceng[x]-r[x],R=ceng[x]-l[x];
		l[x]=L,r[x]=R;
//		cout<<x<<' '<<lim[x]<<' '<<l[x]<<' '<<r[x]<<'\n';
		ch1[last[l[x]-1]].push_back(x);
		if(lim[x]>=r[x])ch2[last[r[x]]].push_back(x);
	}
	for(auto d:t1.w[x])
	{
		int s=0;
		zhi[d][0]=lim[x];
		lca[d][0]=x;
		while(lca[lca[d][s]][s])
		{
			zhi[d][s+1]=min(zhi[d][s],zhi[lca[d][s]][s]);
			lca[d][s+1]=lca[lca[d][s]][s];
//			cout<<d<<' '<<s+1<<' '<<zhi[d][s+1]<<'\n'; 
			++s;
		}
		dfs(d,c+1);
		int now=d;
		fd(i,19,0)
		{
//			cout<<now<<' '<<i<<' '<<lim[d]<<'\n'; 
			if(zhi[now][i]>=lim[d])
			{
				now=lca[now][i];
			}
		}
		now=lca[now][0];
//		cout<<now<<' '<<d<<'\n';
		t2.w[now].push_back(d);
	}
	t1.ed[x]=s;
}
void tree(int x)
{//cout<<x<<' ';
	seg[t2.dfn[x]=++s]=x;
	for(auto d:t2.w[x])
	{
		to[d]=x;
		tree(d);
	}
	t2.ed[x]=s;
//	cout<<x<<' ';
	add[t2.dfn[x]-1].push_back({x,-1});
	add[t2.ed[x]].push_back({x,1});
	ch3[lim[x]].push_back(x);
}
void dfs1(int x)
{
	if(x!=1)
	{
		f[x]=(t1.cha(t1.ed[x])-t1.cha(t1.dfn[x]-1)+mod)%mod;
		qz[x]=(qz[x]+f[x])%mod;
	}
	for(auto d:ch1[x])//-
	{
		int now=d;
		fd(i,19,0)if(zhi[now][i]>=l[d])
		{
			now=lca[now][i];
		}
		now=lca[now][0];
//		cout<<x<<' '<<d<<"@ "<<now<<'\n';
		t1.add(t1.dfn[now],qz[x]);
		t1.add(t1.dfn[d],mod-qz[x]);
	}
	for(auto d:ch2[x])//+
	{
		int now=d;
		fd(i,19,0)if(zhi[now][i]>=r[d])
		{
			now=lca[now][i];
		}
		now=lca[now][0];
//		cout<<x<<' '<<d<<"! "<<now<<' '<<f[x]<<'\n';
		t1.add(t1.dfn[now],mod-qz[x]);
		t1.add(t1.dfn[d],qz[x]);
	}
	for(auto d:ch3[x])//+
	{
//		cout<<x<<' '<<d<<' '<<use[d]<<' '<<qz[x]<<'\n';
		t1.add(t1.dfn[to[d]],mod-use[d]*qz[x]%mod);
		t1.add(t1.dfn[d],use[d]*qz[x]%mod);
	}
	for(auto d:t1.w[x])
	{
		qz[d]=qz[x]; 
		dfs1(d);
	}
}
signed main()
{//freopen("1.in","r",stdin);freopen("1.out","w",stdout);
	int id=read();
	int T=read();
	while(T--)
	{
		n=read();
		clear();s=0;
		fo(i,2,n)
		{
			ll x=read();
			t1.w[x].push_back(i);
			l[i]=read();
			r[i]=read();
			lim[i]=read();
		}
		qz[1]=f[1]=1;
		dfs(1,1);
		s=0;
		tree(1);
		fo(i,1,n)
		{//cout<<i<<'\n';
			t2.add(l[seg[i]],1);
			t2.add(r[seg[i]],-1);
//			cout<<i<<'\n';
			for(auto d:add[i])
			{
				use[d.id]+=d.tp*t2.cha(lim[d.id]);
//				cout<<i<<' '<<d.id<<' '<<d.tp*t2.cha(lim[d.id])<<'\n';
			}
		}
//		fo(i,1,n)cout<<use[i]<<' ';
		dfs1(1);
		fo(i,2,n)cout<<f[i]<<' ';cout<<'\n';
	}
}