#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
const int Mod=998244353;
typedef long long ll;

int cid,T;
int n;
int p[N],h[N];
vector<int> sons[N];
pair<int,int> a[N];
int dep[N];
int siz[N],son[N],dfn[N],rnk[N],num,top[N];
int stk[N],tp,dp[N],sum[N];

void dfs1(int u) {
	siz[u]=1;
	son[u]=0;
	for(int v:sons[u]) {
		dfs1(v);
		if(siz[v]>siz[son[u]]) son[u]=v;
		siz[u]+=siz[v];
	}
}

void dfs2(int u,int tp) {
	top[u]=tp;
	dfn[u]=++num;
	rnk[num]=u;
	if(son[u]) dfs2(son[u],tp);
	for(int v:sons[u]) {
		if(v==son[u]) continue;
		dfs2(v,v);
	}
}

map<int,int> mp;
int ans;

void add(int pos,int val) {
	ans=(ans+Mod-1ll*mp[pos]*sum[pos]%Mod)%Mod;
	mp[pos]=(mp[pos]+val)%Mod;
	ans=(ans+1ll*mp[pos]*sum[pos]%Mod)%Mod;
	if(!mp[pos]) mp.erase(pos);
}

void dfs3(int u,int mn,map<int,int> &mp) {
	mn=min(mn,dep[u]-h[u]-1);
	add(dep[u]-a[u].second-1,-1),add(min(mn,dep[u]-a[u].first),1);
	mp[dep[u]-a[u].second-1]=(mp[dep[u]-a[u].second-1]+1)%Mod;
	mp[min(mn,dep[u]-a[u].first)]=(mp[min(mn,dep[u]-a[u].first)]+Mod-1)%Mod;
	for(int v:sons[u]) {
		if(v==son[u]) continue;
		dfs3(v,mn,mp);
	}
}

void solve(int u) {
	vector<int> arr;
	int x=u;
	while(x) {
		arr.push_back(x);
		x=son[x];
	}
	int sz=arr.size();
	vector<map<int,int> > cng(sz);
	mp.clear();
	for(int i=sz-1;i>=0;i--) {
		dfs3(arr[i],dep[arr[i]]-h[arr[i]]-1,cng[i]);
		while(mp.size()) {
			auto it=--mp.end();
			if((*it).first<=dep[arr[i]]-h[arr[i]]-1) break;
			int x=(*it).first,y=(*it).second;
			add(x,Mod-y);
			cng[i][x]=(cng[i][x]+y)%Mod;
			add(dep[arr[i]]-h[arr[i]]-1,y);
			cng[i][dep[arr[i]]-h[arr[i]]-1]=(cng[i][dep[arr[i]]-h[arr[i]]-1]+Mod-y)%Mod;
		}
	}
	for(int i=0;i<sz;i++) {
		dp[arr[i]]=(dp[arr[i]]+ans)%Mod;
		stk[++tp]=arr[i];
		sum[tp]=(sum[tp-1]+dp[arr[i]])%Mod;
		for(auto j:cng[i]) add(j.first,j.second);
	}
	for(int i=sz-1;i>=0;i--) {
		for(int j:sons[arr[i]]) {
			if(j==son[arr[i]]) continue;
			solve(j);
		}
		tp--;
	}
}

int main() {
	scanf("%d%d",&cid,&T);
	while(T--) {
		scanf("%d",&n);
		for(int i=1;i<=n;i++) sons[i].clear(),dp[i]=0;
		dep[1]=1;
		for(int i=2;i<=n;i++) {
			scanf("%d%d%d%d",&p[i],&a[i].first,&a[i].second,&h[i]);
			dep[i]=dep[p[i]]+1;
			sons[p[i]].push_back(i);
		}
		dfs1(1);
		num=0;
		dfs2(1,1);
		dp[1]=1;
		solve(1);
		for(int i=2;i<=n;i++) printf("%d ",dp[i]);printf("\n");
	}
	return 0;
}