//Author: Kevin
#include<bits/stdc++.h>
#include <immintrin.h>
#include <stdint.h>
//#pragma GCC optimize("O2")
using namespace std;
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rsrt(x) sort(rALL(x))
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
#define sz(v) (int)((v).size())
void die(string S){puts(S.c_str());exit(0);}
namespace Polynomial
{
	using ll=long long;
	using poly=vector<ll>;
	const ll mod=998244353;
	ll ksm(ll a,ll b)
	{
		ll ans=1;
		while(b)
		{
			if(b&1) ans=ans*a%mod;
			b>>=1;
			a=a*a%mod;
		}
		return ans;
	}
	const poly operator +(const poly &a,const poly &b)
	{
		int p=sz(a),q=sz(b);
		int n=max(p,q);
		poly ret(n,0);
		for(int i=0;i<n;i++)
		{
			if(i<p) ret[i]+=a[i];
			if(i<q) ret[i]+=b[i];
			if(ret[i]>=mod) ret[i]-=mod;
		}
		return ret;
	}
	const poly operator -(const poly &a,const poly &b)
	{
		int p=sz(a),q=sz(b);
		int n=max(p,q);
		poly ret(n,0);
		for(int i=0;i<n;i++)
		{
			if(i<p) ret[i]+=a[i];
			if(i<q) ret[i]+=mod-b[i];
			if(ret[i]>=mod) ret[i]-=mod;
		}
		return ret;
	}
	poly operator *(poly a,poly b)
	{
		if(max(sz(a),sz(b))<=250||min(sz(a),sz(b))<=50)
		{
			vector<longer> ret(sz(a)+sz(b)-1);
			for(int i=0;i<sz(a);i++)
				for(int j=0;j<sz(b);j++)
					ret[i+j]+=a[i]*b[j];
			poly res;
			for(auto x:ret) res.pb(x%mod);
			return res;
		}
		const ll g=3;
		int len=sz(a)+sz(b);
		int m=1;
		while(m<sz(a)+sz(b)) m*=2;
		a.resize(m);
		b.resize(m);
		vector<int> rev(m);
		for(int i=0;i<m;i++)
			rev[i]=(rev[i>>1]>>1)|((i&1)*(m>>1));
		for(int i=0;i<m;i++)
			if(rev[i]<i)
			{
				swap(a[i],a[rev[i]]);
				swap(b[i],b[rev[i]]);
			}
		for(int i=1;i<m;i<<=1)
		{
			ll gn=ksm(g,(mod-1)/i/2);
			for(int j=0;j<m;j+=(i<<1))
			{
				ll g0=1;
				for(int k=0;k<i;k++,g0=g0*gn%mod)
				{
					{
						ll x=a[j+k],y=g0*a[i+j+k]%mod;
						a[j+k]=(x+y)%mod;
						a[i+j+k]=(x+mod-y)%mod;
					}
					{
						ll x=b[j+k],y=g0*b[i+j+k]%mod;
						b[j+k]=(x+y)%mod;
						b[i+j+k]=(x+mod-y)%mod;
					}
				}
			}
		}
		for(int i=0;i<m;i++)
			a[i]=a[i]*b[i]%mod;
		for(int i=0;i<m;i++)
			if(rev[i]<i)
				swap(a[i],a[rev[i]]);
		for(int i=1;i<m;i<<=1)
		{
			ll gn=ksm(g,(mod-1)/i/2*(mod-2));
			for(int j=0;j<m;j+=(i<<1))
			{
				ll g0=1;
				for(int k=0;k<i;k++,g0=g0*gn%mod)
				{
					ll x=a[j+k],y=g0*a[i+j+k]%mod;
					a[j+k]=(x+y)%mod;
					a[i+j+k]=(x+mod-y)%mod;
				}
			}
		}
		ll val=ksm(m,mod-2);
		for(int i=0;i<m;i++)
			a[i]=a[i]*val%mod;
		a.resize(len-1);
		return a;
	}
	poly inv(poly p,int deg)
	{
		p.resize(deg);
		if(deg==1) return {ksm(p[0],mod-2)};
		poly w=inv(p,(deg+1)/2);
		poly g=w+w-p*w*w;
		g.resize(deg);
		return g;
	}
	poly deriv(poly p)
	{
		for(int i=0;i<sz(p);i++)
			p[i]=p[i]*i%mod;
		p.erase(p.begin());
		return p;
	}
	poly integ(poly p)
	{
		p.insert(p.begin(),0);
		for(int i=0;i<sz(p);i++)
			p[i]=p[i]*ksm(i,mod-2)%mod;
		return p;
	}
	poly ln(poly p)
	{
		return integ(deriv(p)*inv(p,sz(p)));
	}
	poly exp(poly p,int deg)
	{
		p.resize(deg);
		if(deg==1)
			return {1};
		poly g=exp(p,(deg+1)/2);
		g=g*(poly{1}-ln(g)+p);
		g.resize(deg);
		return g;
	}
	const poly operator %(poly a,poly b)
	{
		if(sz(a)<sz(b)) return a;
		int n=sz(a),m=sz(b);
		int d=n-m+1;
		poly a2=a,b2=b;
		reverse(a2.begin(),a2.end());
		reverse(b2.begin(),b2.end());
		a2.resize(d);
		b2.resize(d);
		poly q=a2*inv(b2,d);
		q.resize(d);
		reverse(q.begin(),q.end());
		q=a-b*q;
		q.resize(m-1);
		return q;
	}
	const poly operator /(poly a,poly b)
	{
		if(sz(a)<sz(b)) return a;
		int n=sz(a),m=sz(b);
		int d=n-m+1;
		poly a2=a,b2=b;
		reverse(a2.begin(),a2.end());
		reverse(b2.begin(),b2.end());
		a2.resize(d);
		b2.resize(d);
		poly q=a2*inv(b2,d);
		q.resize(d);
		reverse(q.begin(),q.end());
		return q;
	}
}
using namespace Polynomial;
const int B=250;
int n,q;
poly f[100100];
vector<int> G[100100];
int key[100100];
int s[100100];
poly g[100100],h[100100],p[100100];
vector<int> vk;
int d[500500],fat[500500],tp[500500],son[500500],siz[500500],in[500500],out[500500],dfn;
int ind[500500];
void dfs1(int u,int fa)
{
	fat[u]=fa;
	d[u]=d[fa]+1;
	siz[u]=1;
	for(auto v:G[u])
		if(v!=fa)
		{
			dfs1(v,u);
			siz[u]+=siz[v];
			if(siz[v]>siz[son[u]])
				son[u]=v;
		}
}
void dfs2(int u,int fa)
{
	in[u]=++dfn;
	if(!tp[u]) tp[u]=u;
	if(son[u])
	{
		tp[son[u]]=tp[u];
		dfs2(son[u],u);
	}
	for(auto v:G[u])
		if(v!=fa&&v!=son[u])
			dfs2(v,u);
	out[u]=dfn;
}
inline int lca(int u,int v)
{
	while(tp[u]!=tp[v])
	{
		if(d[tp[u]]<d[tp[v]]) swap(u,v);
		u=fat[tp[u]];
	}
	if(d[u]<d[v]) return u;
	return v;
}
void dfs(int u,int fa)
{
	s[u]=sz(f[u]);
	for(auto v:G[u])
		if(v!=fa)
		{
			dfs(v,u);
			s[u]+=s[v];
		}
	if(s[u]>B)
	{
		vk.pb(u);
		key[u]=1;
		s[u]=0;
	}
}
poly calc(int u,int fa,int l,int r)
{
	if(l==r)
	{
		if(G[u][l]==fa) return {1};
		return g[G[u][l]];
	}
	int mid=(l+r)/2;
	return calc(u,fa,l,mid)*calc(u,fa,mid+1,r);
}
ll sum[100100];
void dfs3(int u,int fa)
{
	vector<int> vec;
	for(auto v:G[u])
		if(v!=fa)
		{
			dfs3(v,u);
			ind[u]+=ind[v];
			if(ind[v])
				vec.pb(ind[v]);
		}
	if(key[u])
	{
		g[u]={1};
		h[u]=f[u]*calc(u,fa,0,sz(G[u])-1);
		if(sz(vec))
		{
			auto calc2=[&](auto calc2,int l,int r)->poly
			{
				if(l==r) return h[vec[l]];
				int mid=(l+r)/2;
				return calc2(calc2,l,mid)*calc2(calc2,mid+1,r);
			};
			h[u]=h[u]*calc2(calc2,0,sz(vec)-1);
		}
		ind[u]=u;
		p[u]=h[u];
		for(int i=1;i<sz(p[u]);i++)
			p[u][i]=(p[u][i]+p[u][i-1])%mod;
	}
	else
		g[u]=f[u]*calc(u,fa,0,sz(G[u])-1);
	sum[u]=accumulate(ALL(g[u]),0ll)%mod;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		int k;
		cin>>k;
		f[i].resize(k+1);
		for(auto &x:f[i])
			cin>>x;
	}
	for(int i=1;i<n;i++)
	{
		int u,v;
		cin>>u>>v;
		G[u].pb(v);
		G[v].pb(u);
	}
	dfs1(1,0);
	dfs2(1,0);
	dfs(1,0);
	vector<int> nvk;
	vk.pb(1);
	for(auto x:vk)
		for(auto y:vk)
			nvk.pb(lca(x,y));
	srt(nvk);
	uni(nvk);
	for(auto x:nvk)
		key[x]=1;
	vk=nvk;
	dfs3(1,0);
	int lst=0;
	h[0]={1};
	p[0]={1};
	while(q--)
	{
		int x,l,r;
		cin>>x>>l>>r;
		x^=lst;
		l^=lst;
		r^=lst;
		ll sum=0;
		for(int i=0;i<sz(g[x]);i++)
		{
			int l1=max(0,l-i);
			int r1=min(sz(p[ind[x]])-1,r-i);
			if(l1>r1) continue;
			if(l1) sum=(sum+g[x][i]*(p[ind[x]][r1]-p[ind[x]][l1-1]+mod))%mod;
			else sum=(sum+g[x][i]*p[ind[x]][r1])%mod;
		}
		lst=sum;
		cout<<lst<<'\n';
	}
	return 0;
}