//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=1e5+10;
int const mod=998244353;
int n,l[N],r[N],Fa[N],h[N];
vector<int>a[N];
#define add(x,y) (x=(x+y)%mod)
namespace BF{
    int const N=5e3+10;
    int Sum,mini[N],kth[N][N],dp[N],sm[N],dep[N];
    inline void dfs(int x,int fa){
        dep[x]=dep[fa]+1,kth[x][dep[x]]=x;
        rep(i,1,dep[x]-1) kth[x][i]=kth[fa][i];
        for (auto v:a[x]) dfs(v,x);
    }
    inline void getdp(int x,int Min){
        Min=min(Min,mini[x]);
        int liml=dep[x]-r[x],limr=dep[x]-l[x];
        limr=min(limr,Min);
        if (x!=1 && liml<=limr)
            add(Sum,(sm[kth[x][limr]]+mod-sm[kth[x][liml-1]])%mod);
        for (auto v:a[x]) getdp(v,Min);
    }
    inline void Dfs(int x,int fa){
        if (x!=1) Sum=0,getdp(x,mini[x]),dp[x]=Sum;
        sm[x]=sm[Fa[x]],add(sm[x],dp[x]);
        for (auto v:a[x]) Dfs(v,x);
    }
    inline void work(){
        rep(i,1,n) dp[i]=sm[i]=0;
        dp[1]=1;
        rep(i,1,n) sm[i]=1;
        dfs(1,0);
        rep(i,1,n) mini[i]=dep[i]-h[i]-1;
        Dfs(1,0);
        rep(i,2,n) cout<<dp[i]<<' ';
        cout<<'\n';
    }
}
namespace Sub1{
    int Sum,id1[N],id2[N],fa[20][N],dp[N],rev[N],siz[N],heavy[N],dep[N],dfn[N],L[N],R[N];
    struct Tree_Array{
        int c[N];
        #define lowbit(x) (x&(-x))
        inline void update(int x,int v){while (x<N) c[x]+=v,c[x]%=mod,x+=lowbit(x);}
        inline int query(int x){int R=0;while (x) R+=c[x],R%=mod,x-=lowbit(x);return R;}
    }T,T2,T3;
    int answer[N];
    vector< pair<int,int> >qrys[N];
    inline int kth(int x,int y){
        per(i,19,0)
            if (y>>i&1) x=fa[i][x];
        return x;
    }
    inline void predfs(int x){
        siz[x]=1,dfn[x]=++dfn[0],rev[dfn[0]]=x,L[x]=dfn[x];
        for (auto v:a[x]){
            dep[v]=dep[x]+1,predfs(v),siz[x]+=siz[v];
            if (siz[v]>siz[heavy[x]]) heavy[x]=v;
        }
        R[x]=dfn[x]+siz[x]-1;
    }
    inline int qry(int id){
        return T.query(id);
    }
    inline void del(int x){
        add(Sum,mod-qry(dfn[id1[x]])+qry(dfn[Fa[id2[x]]]));
        for (auto v:a[x]) del(v);
    }
    inline void addd(int x){
        add(Sum,qry(dfn[id1[x]])+mod-qry(dfn[Fa[id2[x]]]));
        for (auto v:a[x]) addd(v);
    }
    inline void dfs(int x){
        if (x!=1) dp[x]=Sum;
        T.update(L[x],dp[x]),T.update(R[x]+1,mod-dp[x]);
        Sum+=dp[x]*answer[x],Sum%=mod;
        // int sb=0;
        // rep(i,L[x]+1,R[x]){
        //     int id=rev[i];
        //     if (dep[id2[id]]<=dep[x] && dep[x]<=dep[id1[id]]) Sum+=dp[x],Sum%=mod,++sb;
        // }
        // answer[x]=0;
        // rep(i,L[x]+1,R[x]){
        //     int id=rev[i];
        //     if (dep[x]<=dep[id1[id]]) ++answer[x];
        //     if (dep[x]<dep[id2[id]]) --answer[x];
        // }
        // cerr<<sb<<' '<<answer[x]<<" ???\n";
        // int kel=0;
        // rep(i,1,n){
        //     if (dep[id2[x]]<=dep[i] && dep[i]<=dep[id1[x]] && L[i]<=dfn[x] && dfn[x]<=R[i])
        //         kel+=dp[i],kel%=mod;
        // }
        // cerr<<x<<" -> "<<-kel<<' '<<-qry(dfn[id1[x]])+qry(dfn[Fa[id2[x]]])<<" ???\n";
        add(Sum,mod-qry(dfn[id1[x]])+qry(dfn[Fa[id2[x]]]));
        if (heavy[x]){
            for (auto v:a[x])
                if (v^heavy[x]) del(v);
            dfs(heavy[x]);
            for (auto v:a[x])
                if (v^heavy[x]) addd(v),dfs(v);
        }
    }
    inline void work(){
        memset(T.c,0,sizeof(T.c)),
        memset(T2.c,0,sizeof(T2.c)),
        memset(T3.c,0,sizeof(T3.c));
        memset(answer,0,sizeof(answer));
        Sum=dfn[0]=0;
        memset(dp,0,sizeof(dp)),memset(heavy,0,sizeof(heavy));
        rep(i,1,n) fa[0][i]=Fa[i];
        rep(i,1,n) qrys[i].clear();
        rep(j,1,19) rep(i,1,n) fa[j][i]=fa[j-1][fa[j-1][i]];
        rep(i,1,n) id1[i]=kth(i,l[i]),id2[i]=kth(i,r[i]);
        dp[1]=1,predfs(1);
        rep(i,1,n) qrys[R[i]].push_back({i,dep[i]}),qrys[L[i]].push_back({-i,dep[i]});
        rep(i,1,n){
            int id=rev[i];
            T2.update(dep[id1[id]]+1,1),T3.update(dep[id2[id]]+1,1);
            for (auto it:qrys[i]){
                int id=it.first,T=it.second;
                if (id>0){
                    answer[id]+=T2.query(N-1)-T2.query(T);
                    answer[id]-=T3.query(N-1)-T3.query(T+1);
                }else{
                    id=-id;
                    answer[id]-=T2.query(N-1)-T2.query(T);
                    answer[id]+=T3.query(N-1)-T3.query(T+1);
                }
            }
        }
        dfn[0]=0,dfs(1);
        rep(i,2,n) cout<<dp[i]<<' ';
        cout<<'\n';
    }
}
inline void solve(){
    cin>>n,l[1]=r[1]=1,h[1]=-1e9;
    rep(i,1,n) a[i].clear();
    rep(i,2,n){
        int p;cin>>p>>l[i]>>r[i]>>h[i];
        a[p].push_back(i),Fa[i]=p;
    }
    if (n<=5000) return BF::work();
    int tag1=1,tag2=1;
    rep(i,2,n) tag1&=l[i]==r[i],tag2&=h[i]==0;
    if (tag2) return Sub1::work();
}
signed main(){
    // freopen("ex_4.in","r",stdin);
    // freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int c,t=1;
    cin>>c>>t;
    while (t--) solve();
    // cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
    return 0;
}