#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=1e5+5,M=6e5+5,S=2e4+5,inf=(ll)8e12,mo=998244353;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int cid,T;
int n,l[N],r[N],h[N],fa[N],dep[N];
int sz[N],hson[N],dfn[N],top[N],nw[N],cntp=0;
vector<int>e[N];
ll dp[N],f[N];
void dfs1(int x,int f){
    dep[x]=dep[f]+1,sz[x]=1;
    for(auto j:e[x]){
        dfs1(j,x);
        sz[x]+=sz[j];
        if(sz[j]>sz[hson[x]])hson[x]=j;
    }
}
void dfs2(int x,int topp){
    top[x]=topp,dfn[x]=++cntp,nw[cntp]=x;
    if(hson[x])dfs2(hson[x],topp);
    for(auto j:e[x]){
        if(j==hson[x])continue;
        dfs2(j,j);
    }
}
ll nres=0;
struct inter{
    map<int,int>itv;
    stack<pii>stk;
    int tagg[N];
    void modify(int x,int v){
        stk.push(mp(x,v));
        itv[x]+=v;
    }   
    vector<int>nwe;
    void erase(int v){
        map<int,int>::iterator it=itv.end();
        nwe.clear();
        while(it!=itv.begin()){
            it--;
            if(it->fir>=v){
                nwe.push_back(it->fir),stk.push(mp(it->fir,-(it->sec)));
                modify(v-1,it->sec);
            }
            else break;
        }
        for(auto j:nwe)
            itv.erase(itv.find(j));
    }
    void clr(int x){
        //printf("!!!clr%d:\n",x);
        while((int)stk.size()>tagg[x]){
            int pos=stk.top().fir,v=stk.top().sec;
            nres-=f[pos]*(ll)v%mo,itv[pos]-=v,nres=(nres+mo)%mo;
            //printf("+%d %d %d\n",pos,v,nres);
            stk.pop();
        }
    }
}H,L;
void dfs4(int x){
    int le=dep[x]-r[x],ri=dep[x]-l[x],upp=dep[x]-h[x];
    for(auto j:e[x])
        dfs4(j);
    L.modify(ri,1),L.modify(le-1,-1);
    L.erase(upp);
}
void solve_link(int x){
    int endp=x;
    while(hson[endp])
        endp=hson[endp];
    H.itv.clear();
    repp(i,dfn[endp],dfn[x]){
        H.tagg[i]=H.stk.size();
        int le=dep[nw[i]]-r[nw[i]],ri=dep[nw[i]]-l[nw[i]],upp=dep[nw[i]]-h[nw[i]];
        for(auto j:e[nw[i]]){
            if(j==hson[nw[i]])continue;
            L.itv.clear(),dfs4(j);
            for(auto nwm:L.itv)
                H.modify(nwm.fir,nwm.sec);
        }
        H.modify(ri,1),H.modify(le-1,-1);
        H.erase(upp);
    }
    nres=0;
    for(auto j:H.itv)
        if(j.fir>=0)nres+=f[j.fir]*(ll)j.sec,nres%=mo;//printf(",,,%lld %lld %lld\n",j.fir,j.sec,nres);
    rep(i,dfn[x],dfn[endp]){
        dp[nw[i]]+=nres;
        if(dep[nw[i]])f[dep[nw[i]]]=f[dep[nw[i]]-1];
        f[dep[nw[i]]]+=dp[nw[i]],f[dep[nw[i]]]%=mo;
        H.clr(i);
    }
    rep(i,dfn[x],dfn[endp])
        f[dep[nw[i]]]=0;
}
void dfs3(int x){
    if(top[x]==x&&x!=1)solve_link(x);
    else if(hson[1]==x)solve_link(x);
    if(x==1)dp[x]=1;
    if(dep[x])f[dep[x]]=f[dep[x]-1];
    f[dep[x]]+=dp[x],f[dep[x]]%=mo;
    if(hson[x])dfs3(hson[x]);
    for(auto j:e[x]){
        if(j==hson[x])continue;
        dfs3(j);
    }
    f[dep[x]]=0;
}
void solve(){
    read(n);
    rep(i,1,n)
        e[i].clear(),hson[i]=top[i]=dp[i]=f[i]=0;
    rep(i,2,n){
        read(fa[i]),read(l[i]),read(r[i]),read(h[i]);
        e[fa[i]].push_back(i);
    }
    dep[0]=-1,cntp=0;
    dfs1(1,0);
    dfs2(1,1);
    dfs3(1);
    rep(i,2,n)
        printf("%lld ",dp[i]);
    puts("");
}
signed main(){
    read(cid),read(T);
    while(T--)
        solve();
    return 0;
}