#include<bits/stdc++.h>
using namespace std;
#define LOCAL 1
#define open_file if(LOCAL) {freopen("mountain.in","r",stdin);freopen("mountain.out","w",stdout);} 
#define pb push_back 
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dec(i,a,b) for(int i=(a);i>=(b);--i)
const int mod=998244353;
void add(int &x,int T) {x+=T;if(x>=mod) x-=mod;}

const int MAXN=1e5+50;
int n;
vector<int> g[MAXN];
int par[MAXN],dep[MAXN];
int A[MAXN],L[MAXN],R[MAXN];//(L,R]

int f[MAXN],dp[MAXN];
void apply(int ed,int tp,int val) {//(tp,ed]
    for(int y=ed;y!=tp;y=par[y]) add(dp[y],val);
}//O(n^2)

struct tree { 
    int B[MAXN];int mult;//
    int nxt[MAXN],ftop[MAXN];//nxt:first A[y]<A[v],if not exist:=0//ftop:first A[y]<=B[v],always exist not=0. 
    int valt[MAXN];
    void work1() {
        rep(u,1,n) {
            int fa=par[u],y;
            for(y=fa;y&&A[y]>=A[u];y=nxt[y]);nxt[u]=y;  //O(n^2)
            for(y=u;y&&A[y]>B[u];y=nxt[y]);assert(y);ftop[u]=y; //O(n^2)
            add(valt[ftop[u]],1);//!
        }
    }
    void work2() {
        dec(u,n,1) {
            add(valt[nxt[u]],valt[u]);//times 
        }
    }
    int kth_anc(int x,int k) {
        for(int times=k;times;times--) x=par[x];return x;
    }   //O(n^2)
    vector<int> sona[MAXN],sonb[MAXN];
    void init(int op) {
        
        mult=op?(mod-1):(1);
        rep(i,1,n) if(!op) B[i]=R[i];else B[i]=L[i];
        rep(i,0,n) sona[i].clear(),sonb[i].clear();
        rep(i,1,n) valt[i]=0;

        work1();
        work2();

        rep(v,2,n) {
            int fa;//may =0
            fa=kth_anc(v,dep[v]-dep[A[v]]);//A,B>=0 always !
            sona[fa].pb(v);
            fa=kth_anc(v,dep[v]-dep[B[v]]);
            sonb[fa].pb(v);
        }
    }
    void update(int x) {
        for(int v:sonb[x]) {
            apply(v,ftop[v],1ll*mult*f[x]%mod);
        }
        for(int v:sona[x]) {
            apply(v,nxt[v],1ll*mult*valt[v]%mod*f[x]%mod);
        }
    }
}T[2];

void solve() {
    scanf("%d",&n);
    rep(i,1,n) g[i].clear(),dp[i]=f[i]=0;

    dep[1]=1;L[1]=R[1]=A[1]=0;

    rep(u,2,n) {
        scanf("%d",par+u);
        g[par[u]].pb(u);
        dep[u]=dep[par[u]]+1;
        int l,r,h;scanf("%d%d%d",&l,&r,&h);
        A[u]=dep[u]-h-1;
        L[u]=dep[u]-r,R[u]=dep[u]-l;L[u]--;
    }
    T[0].init(0);//0:R,"+"
    T[1].init(1);//1:L,"-",L may =0(not 1!)

    dp[1]=1;
    rep(u,1,n) {
        f[u]=dp[u];add(f[u],f[par[u]]);
        T[0].update(u);
        T[1].update(u);
    }
    rep(u,2,n) {
        printf("%d",dp[u]);
        if(u!=n) putchar(' ');
    }
    puts("");
}

int main() {
    open_file 
    int test_type,test_case;scanf("%d%d",&test_type,&test_case);
    for(;test_case;test_case--) {
        solve() ;
    }
    return 0;
}