#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pii pair<int, int>
#define fi first
#define se second
#define mkp make_pair
using namespace std;

LL read() {
	LL s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int MAXN = 1e5 + 5, mod = 998244353;

auto fplus = [](int x, int y) {return x + y < mod ? x + y : x + y - mod;};
auto fminus = [](int x, int y) {return x >= y ? x - y : x + mod - y;};
auto Fplus = [](int &x, int y) {x = fplus(x, y);};
auto Fminus = [](int &x, int y) {x = fminus(x, y);};

int n;
vector<int> e[MAXN];
int fa[MAXN], dep[MAXN];
int l[MAXN], r[MAXN], h[MAXN], dp[MAXN];

int sz[MAXN], son[MAXN];
int dfn[MAXN], rnk[MAXN], tim = 0, top[MAXN];
int mn[MAXN][20], Fa[MAXN][20], nxt[MAXN], mn2[MAXN][20];

void dfs(int x) {
	sz[x] = 1, son[x] = 0;
	for (int y : e[x]) {
		dfs(y), sz[x] += sz[y];
		if (sz[y] > sz[son[x]])
			son[x] = y;
	}
}

void cut(int x, int tp) {
	top[x] = tp, dfn[x] = ++tim, rnk[tim] = x;
	if (son[x])
		cut(son[x], tp);
	for (int y : e[x])
		if (y != son[x])
			cut(y, y);
}

int get(int x, int v) {//x 的祖先中最深的 p 满足 h[p] <= v
	for (int i = 17; i >= 0; i--)
		if (mn[x][i] > v)
			x = Fa[x][i];
	return x;
}

int get2(int x, int v) {//x 的祖先中最深的 p 满足 h[nxt[p]] < v
	for (int i = 17; i >= 0; i--)
		if (mn2[x][i] >= v)
			x = Fa[x][i];
	return x;
}

int jump(int x, int d) {
	for (int i = 17; i >= 0; i--)
		if ((1 << i) <= d)
			d -= (1 << i), x = Fa[x][i];
	return x;
}

int d[MAXN];
vector<pii> md[MAXN];

void modify(int l, int r, int v, int tp) {
	// cout << l << ' ' << r << ' ' << v << ' ' << tp << endl;
	md[l].push_back(mkp(v, tp));
	md[r + 1].push_back(mkp(v, mod - tp));
}

void mdf(int u, int l, int v, int tp) {//u到 l（不含l）	
	if (!v)
		return ;
	// cout << u << ' ' << l << ' ' << v << ' ' << tp << endl;
	while (top[u] != top[l])
		modify(dfn[top[u]], dfn[u], v, tp), u = fa[top[u]];
	if (u != l)
		modify(dfn[l] + 1, dfn[u], v, tp);
}

int f[MAXN];

namespace SGT {

#define ls (p << 1)
#define rs (p << 1 | 1)
#define mid ((l + r) >> 1)

int base[MAXN << 2], sum[MAXN << 2], tag[MAXN << 2];

void maintain(int p) {
	sum[p] = fplus(sum[ls], sum[rs]);
	base[p] = fplus(base[ls], base[rs]);
}

void build(int l, int r, int p) {
	base[p] = sum[p] = tag[p] = 0;
	if (l == r) return ;
	build(l, mid, ls), build(mid + 1, r, rs);
}

void pushtag(int p, int v) {
	Fplus(sum[p], 1ll * base[p] * v % mod), Fplus(tag[p], v);
}

void pushdown(int p) {
	pushtag(ls, tag[p]), pushtag(rs, tag[p]), tag[p] = 0;
}

void mdf(int l, int r, int p, int x, int y, int v) {
	if (r < x || y < l)
		return ;
	if (x <= l && r <= y) {
		pushtag(p, v);
		return ;
	}
	pushdown(p);
	mdf(l, mid, ls, x, y, v), mdf(mid + 1, r, rs, x, y, v);
	maintain(p);
}

void modify(int l, int r, int p, int x, int v) {
	if (l == r) {
		base[p] = v, sum[p] = 1ll * base[p] * tag[p] % mod;
		return ;
	}
	pushdown(p);
	x <= mid ? modify(l, mid, ls, x, v) : modify(mid + 1, r, rs, x, v);
	maintain(p);
}

}

void mdf(int u, int v) {
	// cout << u << ' ' << v << endl;
	while (u)
		SGT::mdf(1, n, 1, dfn[top[u]], dfn[u], v), u = fa[top[u]];
}

void work() {
	n = read();
	for (int i = 1; i <= n; i++)
		e[i].clear(), md[i].clear();
	for (int i = 2; i <= n; i++) {
		fa[i] = read(), l[i] = read(), r[i] = read(), h[i] = read();
		e[fa[i]].push_back(i), dep[i] = dep[fa[i]] + 1;
		l[i] = dep[i] - l[i], r[i] = dep[i] - r[i], swap(l[i], r[i]);
	}
	for (int i = 1; i <= n; i++)
		h[i] = dep[i] - h[i] - 1;//, cout << h[i] << ' ';
	// cout << endl;
	// for (int i = 2; i <= n; i++)
	// 	cout << l[i] << ' ' << r[i] << endl;
	// cout << endl;
	tim = 0, dfs(1), cut(1, 1);
	for (int i = 2; i <= n; i++)
		mn[i][0] = h[i], Fa[i][0] = fa[i];
	for (int j = 1; j <= 18; j++)
		for (int i = 1; i <= n; i++)
			Fa[i][j] = Fa[Fa[i][j - 1]][j - 1], mn[i][j] = min(mn[i][j - 1], mn[Fa[i][j - 1]][j - 1]);
	for (int i = 2; i <= n; i++)
		nxt[i] = get(fa[i], h[i]), mn2[i][0] = h[nxt[i]];
	for (int j = 1; j <= 18; j++)
		for (int i = 1; i <= n; i++)
			mn2[i][j] = min(mn2[i][j - 1], mn2[Fa[i][j - 1]][j - 1]);
	// cout << endl;
	memset(d, 0, sizeof d);
	for (int i = 2; i <= n; i++) {
		// cout << i << ":\n";
		int p = get(i, r[i]), L = jump(i, dep[i] - l[i]), R = jump(i, dep[i] - r[i]);
		if (h[p] < l[i]) {
			if (l[i] <= dep[p])
				mdf(i, p, R, 1), mdf(i, p, fa[L], -1);
			else
				mdf(i, L, R, 1), mdf(i, L, fa[L], -1);
			continue;
		}
		mdf(i, p, R, 1), d[p]++;
		// cout << p << ' ';
		p = get2(p, l[i]), d[p]--;
		// cout << p << ' ' << nxt[p] << ' ' << L << endl;
		if (l[i] <= dep[nxt[p]])
			mdf(p, nxt[p], jump(p, dep[p] - h[p]), 1), mdf(i, nxt[p], fa[L], mod - 1);
		else
			mdf(p, L, jump(p, dep[p] - h[p]), 1), mdf(i, L, fa[L], mod - 1);
	}
	// cout << endl;
	for (int i = n; i > 1; i--)
		if (d[i])
			mdf(i, nxt[i], jump(i, dep[i] - h[i]), d[i]), d[nxt[i]] += d[i];
	// cout << endl;
	SGT::build(1, n, 1);
	for (int i = 1; i <= n; i++) {
		for (pii x : md[i])
			mdf(x.fi, x.se);
		if (i == 1)
			f[i] = 1;
		else
			f[i] = SGT::sum[1];
		// cout << "Q" << ' ' << i << ' ' << f[i] << endl;
		SGT::modify(1, n, 1, i, f[i]);
	}
	for (int i = 2; i <= n; i++)
		printf("%d%c", f[dfn[i]], " \n"[i == n]);
}

signed main() {
	// freopen("ex_4.in", "r", stdin);
	// freopen("1.out", "w", stdout);
	read(); int t = read();
	while (t--)
		work();
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	return 0;
}