#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
//#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[1<<20],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
	bool operator <(const tup nd)const
	{return x<nd.x;}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[25];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' '&&st!='\r')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
    namespace Poly
    {
        inline vi fix(vi A,int n){return A.resize(n),A;}
        const int MAXN=2000000;
        int Shape,VBL,Invn[MAXN],R[MAXN<<1],Prt[MAXN<<1],P0[50010],P1[50010];
        inline void init()
        {
            P0[0]=P1[0]=1,VBL=ceil(sqrt(MOD)),Invn[0]=1;
            for(int i=1;i<MAXN;++i)Invn[i]=Cmul(Invn[i-1],i);
            int tmp=power(Invn[MAXN-1],MOD-2);
            for(int i=MAXN-1;i>=1;--i)Invn[i]=Cmul(tmp,Invn[i-1]),Mmul(tmp,i);
            for(int i=1;i<=VBL;++i)P0[i]=Cmul(P0[i-1],Root);
            for(int i=1;i<=VBL;++i)P1[i]=Cmul(P1[i-1],P0[VBL]);
        }
        inline int powerr(int x){return Cmul(P0[x%VBL],P1[x/VBL]);}
        inline void NTT(vi&A,int n,int opt)
        {
            static ull B[MAXN<<1],iv;
            A.resize(n);
            for(int i=0;i<n;++i)B[i]=A[R[i]];
            for(int mid=1;mid<n;mid<<=1)
            {
                for(int j=0;j<n;j+=mid<<1)
                {
                    for(int k=j;k<j+mid;++k)
                    {
                        ull x=B[k],y=Prt[mid+k-j]*B[k+mid]%MOD;
                        B[k]=x+y,B[k+mid]=x+MOD-y;
                    }
                }
            }
            if(opt==1)for(int i=0;i<n;++i)A[i]=B[i]%MOD;
            else
            {
                reverse(B+1,B+n),iv=power(n,MOD-2);
                for(int i=0;i<n;++i)A[i]=Cmul(B[i]%MOD,iv);
            }
        }
        inline void init(int lim)
        {
            if(lim==Shape)return;
            int n=lim/2;
            for(int i=0;i<lim;++i)R[i]=(R[i>>1]>>1)|((i&1)?n:0);
            for(int i=1;i<lim;i<<=1)
            {
                int wm=powerr((MOD-1)/(i<<1));Prt[i]=1;
                for(int j=1;j<i;++j)Prt[i+j]=Cmul(Prt[i+j-1],wm);
            }
            Shape=lim;
        }
        inline vi FFT(vi A,vi B)
        {
            int n=A.size(),m=B.size(),N=1;
            while(N<=n+m)N<<=1;
            init(N),NTT(A,N,1),NTT(B,N,1);
            for(int i=0;i<N;++i)A[i]=Cmul(A[i],B[i]);
            return NTT(A,N,0),A.resize(n+m-1),A;
        }
    }
    using namespace Poly;
    int n,m;
	vi F[100010],G[100010],A[100010];
	int tot,id[100010];
	vi T[100010];
	const int B=1000;
	inline vi mul(vi x,vi y)
	{
		vi z(x.size()+y.size()-1);
		for(int i=0;i<(int)x.size();++i)for(int j=0;j<(int)y.size();++j)
		Madd(z[i+j],Cmul(x[i],y[j]));
		return z;
	}
	void dfs(int x,int fa=0)
	{
		if(A[x].size()>B)F[id[x]=++tot]=A[x],G[x]={1};
		else G[x]=A[x];
		for(auto to:T[x])if(to!=fa)
		{
			dfs(to,x);
			G[x]=mul(G[x],G[to]);
			if(!id[to]);
			else if(!id[x])id[x]=id[to];
			else ++tot,F[tot]=FFT(F[id[x]],F[id[to]]),id[x]=tot;
			if(G[x].size()>B)
			{
				++tot,F[tot]=FFT(F[id[x]],G[x]);
				id[x]=tot,G[x]={1};
			}
		}
	}
	void mian()
	{
		init();
		F[0]={1};
		int x,y,z;
		read(n,m);
		for(int i=1;i<=n;++i)
		{
			read(x),A[i].resize(x+1);
			for(auto&p:A[i])read(p);
		}
		for(int i=1;i<n;++i)read(x,y),T[x].eb(y),T[y].eb(x);
		dfs(1);
		for(int i=0;i<=tot;++i)
		{
			for(int j=1;j<(int)F[i].size();++j)
			Madd(F[i][j],F[i][j-1]);
		}
		int lst=0;
		while(m--)
		{
			read(x,y,z);
			x^=lst,y^=lst,z^=lst;
			int ans=0;
			for(int i=0;i<(int)G[x].size();++i)
			{
				int l=y-i,r=z-i;
				if(l>(int)F[id[x]].size()-1)continue;
				if(r<0)continue;
				Mmax(l,0),Mmin(r,(int)F[id[x]].size()-1);
				l=!l?0:F[id[x]][l-1];
				r=F[id[x]][r];
				Madd(ans,Cmul(Cdel(r,l),G[x][i]));
			}
			write(lst=ans,'\n');
		}
	}
	inline void Mian()
	{
		int T=1,C;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	ios::sync_with_stdio(0);
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}