#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 100100
#define M 300300
#define mod 998244353
IL int read()
{
    reg int x=0,f=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg long long r=1ll*x*y; return r<mod?r:r%mod;}
IL int power(reg int x,reg int p){reg int r=1; for(;p;p>>=1,x=Mul(x,x))if(p&1)r=Mul(r,x); return r;}

namespace NTT
{

int r[M],grt[M+M],a[M],b[M],len;

IL void prework(reg int n)
{
    for(len=1;len<=n;len<<=1);
    for(reg int i=0;i<len;++i)a[i]=b[i]=0,r[i]=r[i>>1]+(i&1)*len>>1;
}

IL void dft(reg int *f)
{
    for(reg int i=len;i--;)if(r[i]>i)std::swap(f[i],f[r[i]]);
    for(reg int k=2,i,j,x,y;k<=len;k<<=1)for(i=0;i<len;i+=k)for(j=i;j<i+k/2;++j)
        x=f[j],y=Mul(f[j+k/2],grt[k+j-i]),f[j]=Add(x,y),f[j+k/2]=Sub(x,y);
}

IL void idft(reg int *f)
{
    dft(f),std::reverse(f+1,f+len);
    reg int inv=mod-(mod-1)/len;
    for(reg int i=len;i--;)f[i]=Mul(f[i],inv);
}

}

using namespace NTT;

const int B=2e3;
int n,q,m,p[N],ans,lim;
std::vector<int>x[N],y[N],G[N],s[N<<2];
int f[N][B+5];

IL void add(reg int u,reg int v){G[u].push_back(v),G[v].push_back(u);}

template<class T>IL void clear(reg T &a){T b; std::swap(a,b);}

void dc(reg int o,reg int l,reg int r)
{
    if(l==r)return s[o]=y[l],void();
    reg int mid=l+r>>1,ls=o<<1,rs=o<<1|1;
    dc(ls,l,mid),dc(rs,mid+1,r);
    reg int mx=s[ls].size()+s[rs].size()-2;
    prework(mx);
    for(reg int i=0;i<s[ls].size();++i)a[i]=s[ls][i];
    for(reg int i=0;i<s[rs].size();++i)b[i]=s[rs][i];
    clear(s[ls]),clear(s[rs]);
    dft(a),dft(b);
    for(reg int i=0;i<len;++i)a[i]=Mul(a[i],b[i]);
    idft(a),clear(s[o]),s[o].resize(mx+1);
    for(reg int i=0;i<=mx;++i)s[o][i]=a[i];
}

int left[N],id[N],blo[N],cnt,fa[N],L[N],R[N];
int g[(N/B)*2+10][N],con[N/B+5][M];
short pre[N/B+5][M];

void dfs(reg int u)
{
    left[u]=p[u],L[u]=cnt+1;
    if(p[u]<B)for(reg int i=0;i<=p[u];++i)f[u][i]=x[u][i];
    for(auto v:G[u])if(v!=fa[u])
    {
        fa[v]=u,dfs(v);
        static int nf[N];
        reg int up1=left[u],up2=left[v];
        if(up1+up2<B)
        {
            for(reg int i=0;i<=up1+up2;++i)nf[i]=0;
            for(reg int i=0,j;i<=up1;++i)for(j=0;j<=up2;++j)
                Pls(nf[i+j],Mul(f[u][i],f[v][j]));
            for(reg int i=0;i<=up1+up2;++i)f[u][i]=nf[i];
        }
        left[u]+=left[v];
    }
    if(left[u]>=B||u==1)
        id[u]=++cnt,left[u]=0,f[u][0]=1;
    R[u]=cnt;
}

std::map<std::pair<int,int>,int>mp;
int tot;

IL int init(reg int l,reg int r)
{
    if(l>r)l=1,r=0;
    if(mp.count({l,r}))return mp[{l,r}];
    mp[{l,r}]=++tot;
    if(l>r)
    {
        for(reg int i=0;i<=lim;++i)g[tot][i]=1;
        return tot;
    }
    for(reg int i=0;i<len;++i)
        if(pre[r][i]==pre[l-1][i])a[i]=Mul(con[r][i],l>1?power(con[l-1][i],mod-2):1);
        else a[i]=0;
    idft(a);
    for(reg int i=0;i<=lim;++i)g[tot][i]=a[i];
    for(reg int i=1;i<=lim;++i)Pls(g[tot][i],g[tot][i-1]);
    return tot;
}

IL int min(reg int x,reg int y){return x<y?x:y;}

main()
{
    for(reg int k=2,w,i;k<M;k<<=1)
    {
        w=power(3,(mod-1)/k),grt[k]=1;
        for(i=1;i<k/2;++i)grt[k+i]=Mul(grt[k+i-1],w);
    }
    n=read(),q=read();
    for(reg int i=1,j;i<=n;++i)
    {
        lim+=p[i]=read(),x[i].resize(p[i]+1);
        for(j=0;j<=p[i];++j)x[i][j]=read();
    }
    for(reg int i=1;i<n;++i)add(read(),read());
    dfs(1);
    for(reg int i=1,j;i<=n;++i)
    {
        for(j=i;!id[j];j=fa[j]);
        blo[i]=j;
    }
    for(reg int i=1,j,b;i<=n;++i)if(b=id[i])
    {
        m=0;
        for(j=1;j<=n;++j)if(blo[j]==i)y[++m]=x[j];
        dc(1,1,m),prework(lim);
        for(j=0;j<s[1].size();++j)a[j]=s[1][j];
        dft(a);
        for(j=0;j<len;++j)
            if(a[j])con[b][j]=a[j];
            else pre[b][j]=con[b][j]=1;
    }
    for(reg int i=2,j;i<=cnt;++i)for(j=0;j<len;++j)
        con[i][j]=Mul(con[i][j],con[i-1][j]),pre[i][j]+=pre[i-1][j];
    for(reg int x,l,r,b,i;q--;)
    {
        x=read()^ans,l=read()^ans,r=min(lim,read()^ans);
        if(l>r)
        {
            printf("%d\n",ans=0);
            continue;
        }
        b=init(L[x],R[x]);
        if(blo[x]==x)
        {
            printf("%d\n",ans=Sub(g[b][r],l?g[b][l-1]:0));
            continue;
        }
        ans=0;
        for(i=0;i<=left[x];++i)
        {
            if(r>=i)Pls(ans,Mul(f[x][i],g[b][r-i]));
            if(l-1>=i)Dec(ans,Mul(f[x][i],g[b][l-i-1]));
        }
        printf("%d\n",ans);
    }
}