#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
namespace solve1{
    const int N=5005;
    int n;
    vector<int> G[N];
    int fa[N],l[N],r[N],d[N];
    int f[N],g[N][N];
    void dfs1(int u){
        int k=1,zu=fa[u];
        while(zu){
            if(k>d[u] && l[u]<=k && k<=r[u]) g[u][zu]++;
            k++; zu=fa[zu];
        }
        for(int v:G[u]){
            dfs1(v);
            int k=1,zu=fa[u];
            while(zu){
                if(k>d[u])
                    g[u][zu] = (g[u][zu]+g[v][zu])%mod;
                k++; zu=fa[zu];
            }
        }
    }
    void main(){
        memset(f,0,sizeof(f));
        memset(g,0,sizeof(g));
        for(int i=1;i<=n;i++) G[i].clear();
        scanf("%d",&n);
        for(int i=2;i<=n;i++){
            scanf("%d%d%d%d",&fa[i],&l[i],&r[i],&d[i]);
            G[fa[i]].push_back(i);
        }
        dfs1(1);
        f[1] = 1;
        for(int u=2;u<=n;u++){
            int zu=fa[u];
            while(zu){
                f[u] = (f[u] + 1ll*f[zu]*g[u][zu]%mod) %mod;
                zu = fa[zu];
            }
            printf("%d ",f[u]);
        }
        puts("");
    }
}

int main(){
	// freopen("ex_2.in","r",stdin);
	// freopen("my.out","w",stdout);
    int tid,T;
    scanf("%d",&tid);
    scanf("%d",&T);
    while(T--){
        if(tid<=5) solve1::main();
    }
	return 0;
}