#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, const T &y) {
  x = min(x, y);
}
constexpr int MOD = 998244353;
int add(int x, int y) {
  x += y;
  return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
  x -= y;
  return x < 0 ? x + MOD : x;
}
void inc(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
constexpr int MAXN = 1e5 + 10;
int n, anc[17][MAXN], dep[MAXN], mn[17][MAXN], cnt[MAXN], dp[MAXN], dfn[MAXN], lst[MAXN], dfc;
vector<int> g[MAXN];
pair<int, int> rg[MAXN];
vector<tuple<int, int, int>> buc[MAXN];
namespace bit {
int bit[MAXN];
void clear() { fill(bit + 1, bit + n + 1, 0); }
void update(int p, int x) {
  for (; p <= n; p += p & -p) inc(bit[p], x);
}
int query(int p) {
  int ret = 0;
  for (; p >= 1; p -= p & -p) inc(ret, bit[p]);
  return ret;
}
}  // namespace bit
int jump(int u, int k) {
  for (int i = 0; 1 << i <= k; ++i)
    if (k >> i & 1) u = anc[i][u];
  return u;
}
int find_le(int u, int x) {
  for (int i = 16; i >= 0; --i)
    if (mn[i][u] >= x) u = anc[i][u];
  return u;
}
void dfs(int u) {
  dfn[u] = ++dfc;
  for (auto v : g[u]) dfs(v);
  lst[u] = dfc;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int sid, cas;
  cin >> sid >> cas;
  while (cas--) {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      buc[i].clear();
      g[i].clear();
      cnt[i] = 0;
    }
    dep[1] = 1;
    for (int i = 2, l, r, h; i <= n; ++i) {
      cin >> anc[0][i] >> l >> r >> h;
      g[anc[0][i]].emplace_back(i);
      dep[i] = dep[anc[0][i]] + 1;
      rg[i] = {dep[i] - r, dep[i] - l};
      mn[0][i] = dep[i] - h - 1;
    }
    dfc = 0;
    dfs(1);
    for (int i = 1; i < 17; ++i) {
      for (int j = 1; j <= n; ++j) {
        anc[i][j] = anc[i - 1][anc[i - 1][j]];
        mn[i][j] = min(mn[i - 1][j], mn[i - 1][anc[i - 1][j]]);
      }
    }
    for (int i = 2; i <= n; ++i) {
      int up1 = find_le(i, rg[i].first);
      buc[jump(i, dep[i] - rg[i].first + 1)].emplace_back(i, up1, MOD - 1);
      int up2 = find_le(i, rg[i].second);
      buc[jump(i, dep[i] - rg[i].second)].emplace_back(i, up2, 1);
      ++cnt[up2];
      --cnt[up1];
    }
    for (int i = n; i >= 2; --i) {
      int up = find_le(i, mn[0][i]);
      buc[mn[0][i]].emplace_back(i, up, cnt[i]);
      cnt[up] += cnt[i];
    }
    bit::clear();
    for (int i = 1; i <= n; ++i) {
      if (i == 1) {
        dp[i] = 1;
      } else {
        dp[i] = add(dp[anc[0][i]], sub(bit::query(lst[i]), bit::query(dfn[i] - 1)));
      }
      for (auto [x, y, c] : buc[i]) {
        bit::update(dfn[x], (ll)dp[i] * c % MOD);
        bit::update(dfn[y], (ll)dp[i] * (MOD - c) % MOD);
      }
    }
    for (int i = 2; i <= n; ++i) cout << sub(dp[i], dp[anc[0][i]]) << " \n"[i == n];
  }
  return 0;
}
/*
g++ B.cpp -o B -std=c++17 -O2 -Wall -Wextra -Wshadow -g -fsanitize=address,undefined
*/
/*
0 1
5
1 1 1 0
2 1 1 0
2 1 2 1
4 2 3 0
*/