//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#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?x+y-mod:x+y))
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';
    }
}
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();
}
signed main(){
    // freopen("ex_2.in","r",stdin);
    // freopen("ex.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;
}