#include <stdio.h>
#include <string.h>

#include <map>
#include <vector>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define fi first
#define se second
#define eb emplace_back

using namespace std;

typedef long long LL;
constexpr int N = 100005, mod = 998244353;

int n;
vector<int> e[N];
int fa[N], de[N], son[N], sz[N], top[N];
int ft[N][20];
int lf[N], rg[N], ht[N];

int norm(int x) {
	return x < 0 ? x + mod : x;
}

int reduce(int x) {
	return x >= mod ? x - mod : x;
}

void Add(int &x, int y) {
	if ((x += y) >= mod) {
		x -= mod;
	}
}

void Sub(int &x, int y) {
	if ((x -= y) < 0) {
		x += mod;
	}
}

void dfs2(int x, int t) {
	top[x] = t;
	for (int y : e[x]) {
		dfs2(y, (y != son[x] ? y : t));
	}
}

struct Dat {
	int x, c;
	Dat() {}
	Dat(int _x, int _c) : x(_x), c(_c) {};
};
vector<Dat> xc[N];
map<int, int> mb[N];

void dfs3(int x) {
	for (int y : e[x]) {
		dfs3(y);
	}
	vector<Dat> &cs = xc[x];
	map<int, int> &cur = mb[top[x]];
	map<int, int>::iterator k;
	while (cur.size() && (k = prev(cur.end()))->fi > ht[x]) {
		cs.eb(k->fi, k->se);
		cur[ht[x]] += k->se;
		cur.erase(k);
	}
	cur[rg[x]] += 1;
	cur[lf[x]] -= 1;
	for (int y : e[x]) {
		if (y != son[x]) {
			for (auto [t, c] : mb[y]) {
				cur[min(t, ht[x])] += c;
			}
		}
	}
}

int f[N], s[N], tt;
int res;

void dfs4(int x) {
	if (x == top[x]) {
		res = 0;
		for (auto [t, c] : mb[x]) {
			res = (res + s[t] * (LL)c) % mod;
		}
	}
	f[x] = norm(res);
	// LOG("%d %d\n", x, f[x]);
	s[tt + 1] = reduce(s[tt] + f[x]), ++tt;
	if (son[x]) {
		/* while ((k = prev(cur.end()))->fi > ht[x]) {
			cs.eb(k->fi, k->se);
			cur[ht[x]] += k->se;
			cur.erase(k);
		} */
		const vector<Dat> &cs = xc[x];
		for (auto [t, c] : cs) {
			res = (res + (s[t] - s[ht[x]]) * (LL)c) % mod;
		}
		/* cur[rg[x]] += 1;
		cur[lf[x]] -= 1; */
		res = (res - s[rg[x]] + s[lf[x]]) % mod;
		/* for (int y : e[x]) {
			if (y != son[x]) {
				for (auto [t, c] : mb[y]) {
					cur[min(t, ht[x])] += c;
				}
			}
		} */
		for (int y : e[x]) {
			if (y != son[x]) {
				for (auto [t, c] : mb[y]) {
					res = (res - s[min(t, ht[x])] * (LL)c) % mod;
				}
			}
		}
		dfs4(son[x]);
	}
	for (int y : e[x]) {
		if (y != son[x]) {
			dfs4(y);
		}
	}
	--tt;
}

int main() {
	int tid, task;
	for (scanf("%d%d", &tid, &task); task--; ) {
		scanf("%d", &n);
		memset(son, 0, n + 2 << 2);
		memset(sz, 0, n + 2 << 2);
		for (int x = 1; x <= n; ++x) {
			e[x].clear();
			xc[x].clear();
			mb[x].clear();
		}
		de[1] = 1;
		for (int x = 2; x <= n; ++x) {
			int a, b, c;
			scanf("%d%d%d%d", fa + x, &a, &b, &c);
			ft[x][0] = fa[x];
			for (int k = 0; ft[x][k]; ++k) {
				ft[x][k + 1] = ft[ft[x][k]][k];
			}
			de[x] = de[fa[x]] + 1;
			lf[x] = de[x] - b - 1;
			rg[x] = de[x] - a;
			ht[x] = de[x] - c - 1;
			lf[x] = min(lf[x], ht[x]);
			rg[x] = min(rg[x], ht[x]);
			e[fa[x]].eb(x);
		}
		for (int x = n; x > 1; --x) {
			sz[x] += 1;
			int y = fa[x];
			sz[y] += sz[x];
			if (sz[x] > sz[son[y]]) {
				son[y] = x;
			}
		}
		f[1] = 1, s[tt = 1] = 1;
		for (int y : e[1]) {
			dfs2(y, y);
			dfs3(y);
			dfs4(y);
		}
		for (int x = 2; x <= n; ++x) {
			printf("%d ", f[x]);
		}
		puts("");
	}
	return 0;
}