#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int B = 4500, P = 998244353, G = 3, GI = (P + 1) / 3;
int lim, llim, r[300005];
void SetLim(int x) {
	llim = __lg(x - 1) + 1, lim = 1 << llim;
	for (int i = 0; i < lim; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << (llim - 1));
}
ll QPow(ll a, ll b) {
	ll res = 1;
	for (; b; b >>= 1, a = a * a % P) if (b & 1) res = res * a % P;
	return res;
}
struct Poly {
	vector<ll> a;
	size_t size() const { return a.size(); }
	void resize(size_t x) { a.resize(x); }
	ll &operator[](int x) { return a[x]; }
	ll operator[](int x) const { return a[x]; }
	Poly() {}
	Poly(const vector<ll> &a) : a(a) {}
	void NTT(int tp) {
		if (size() < lim) resize(lim);
		for (int i = 0; i < lim; i++) if (i < r[i]) swap(a[i], a[r[i]]);
		for (int w = 1; w < lim; w <<= 1) {
			ll omeg = QPow(tp == 1 ? G : GI, (P - 1) / (w << 1));
			for (int i = 0; i < lim; i += (w << 1)) {
				ll t = 1;
				for (int j = 0; j < w; j++) {
					ll x = a[i + j], y = a[i + j + w] * t % P;
					a[i + j] = (x + y >= P ? x + y - P : x + y);
					a[i + j + w] = (x - y < 0 ? x - y + P : x - y);
					t = t * omeg % P;
				}
			}
		}
		if (tp == -1) {
			ll iv = QPow(lim, P - 2);
			for (int i = 0; i < lim; i++) a[i] = a[i] * iv % P;
		}
	}
	Poly &operator*=(Poly b) {
		int sz = size() + b.size() - 1;
		SetLim(sz);
		NTT(1), b.NTT(1);
		for (int i = 0; i < lim; i++) a[i] = a[i] * b[i] % P;
		NTT(-1);
		resize(sz);
		return *this;
	}
	Poly &BFMul(const Poly &b) {
		int sz = size() + b.size() - 1;
		Poly res; res.resize(sz);
		for (int i = 0; i < size(); i++) {
			for (int j = 0; j < b.size(); j++) {
				res[i + j] += a[i] * b[j] % P;
			}
		}
		for (int i = 0; i < sz; i++) res[i] %= P;
		return *this = res;
	}
	bool operator<(const Poly &b) const { return size() > b.size(); }
} g[100005], f[10005], w[100005];
int fC, id[100005];
vector<int> e[100005];
int n, q;
void DFS(int u, int fa) {
	if (w[u].size() <= B) g[u] = w[u], id[u] = 0;
	else {
		f[++fC] = w[u], id[u] = fC;
		g[u].resize(1), g[u][0] = 1;
	}
	vector<ll>().swap(w[u].a);
	bool nid = false;
	for (int v : e[u]) {
		if (v == fa) continue;
		DFS(v, u);
		g[u].BFMul(g[v]);
		if (!id[v]);
		else if (!id[u]) id[u] = id[v];
		else {
			if (!nid) {
				(f[++fC] = f[id[u]]) *= f[id[v]];
				id[u] = fC;
				nid = true;
			}
			else f[id[u]] *= f[id[v]];
		}
		if (g[u].size() > B) {
			if (!nid) {
				(f[++fC] = f[id[u]]) *= g[u];
				id[u] = fC;
				nid = true;
			}
			else f[id[u]] *= f[id[v]];
			g[u].resize(1), g[u][0] = 1;
		}
	}
}
int main() {
	f[0].resize(1), f[0][0] = 1;
	scanf("%d%d", &n, &q);
	for (int i = 1, k; i <= n; i++) {
		scanf("%d", &k), w[i].resize(k + 1);
		for (int j = 0; j <= k; j++) scanf("%lld", &w[i][j]);
	}
	for (int i = 1, u, v; i < n; i++) {
		scanf("%d%d", &u, &v);
		e[u].push_back(v), e[v].push_back(u);
	}
	DFS(1, 0);
	for (int i = 1; i <= fC; i++) {
		for (int j = 1; j < f[i].size(); j++) (f[i][j] += f[i][j - 1]) %= P;
	}
	ll las = 0;
	while (q--) {
		int u, l, r; scanf("%d%d%d", &u, &l, &r);
		u ^= las, l ^= las, r ^= las;
		las = 0;
		for (int i = 0; i < g[u].size(); i++) {
			int x = max(0, l - i), y = min((int)f[id[u]].size() - 1, r - i);
			if (x <= y) {
				las += g[u][i] * f[id[u]][y] % P;
				if (x) las -= g[u][i] * f[id[u]][x - 1] % P;
			}
		}
		printf("%lld\n", las = (las % P + P) % P);
	}
	return 0;
}