#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2.5e5+5,mods=998244353,T=500,M=505;
int n,m,w[N],fa[N],bh[N],st[N],ed[N],dep[N],siz[N],fs[N][20],f[M][M],ans,zd[N],zx[N],dy[N],dfn[N],d[N],mk[N],lg2[N],idx;
signed gs[N][M],dp[N][M];
vector<int>p[N],g[N],jl;
const __uint128_t brt=((__uint128_t)1<<64)/mods;
inline int rdc(int a){ return a-mods*(brt*a>>64); }
void dfs(int x){
    for(int i=1;i<=19;i++)fs[x][i]=fs[fs[x][i-1]][i-1];
    for(int i=0;i<p[x].size();i++){
        int c=p[x][i];
        fs[c][0]=x;dep[c]=dep[x]+1;
        dfs(c);
        zd[x]=max(zd[x],zd[c]+1);
        if(zd[c]>=zd[zx[x]])zx[x]=c;
        for(int j=1;j<M;j++)gs[x][j]+=gs[c][j],gs[x][j]%=mods,dp[x][j]+=1ll*gs[c][j]*gs[c][j]%mods,dp[x][j]%=mods;
    }
    for(int j=bh[x];j<M;j++)gs[x][j]+=w[x],gs[x][j]%=mods;
}
void dfs(int x,int y){
    d[x]=y;mk[x]=1;dfn[x]=++idx;dy[idx]=x;
    if(zx[x])dfs(zx[x],y);
    for(int i=0;i<p[x].size();i++){
        int c=p[x][i];
        if(mk[c])continue;
        dfs(c,c);
    }
    if(x==y){
        g[x].push_back(x);
        for(int i=1,nw=x;i<=zd[x];i++)nw=fa[nw],g[x].push_back(nw);
    }
}
int up(int x,int k){
    if(!k)return x;
    x=fs[x][lg2[k]];
    k-=1<<lg2[k];
    if(dep[x]-dep[d[x]]>=k)return dy[dfn[d[x]]+dep[x]-dep[d[x]]-k];
    return g[d[x]][k-(dep[x]-dep[d[x]])];
}
int gets(int x,int l){
    if(fa[x]<l)return x;
    int k=dep[x]-dep[l];
    if(up(x,k)>=l)return up(x,k);
    return up(x,k-1);
}
void clr(){
    while(jl.size())siz[jl.back()]=0,jl.pop_back();
}
int Solve(int l,int r){
    int res=0;clr();
    for(int i=l;i<=r;i++){
        int x=gets(i,l);
        jl.push_back(x);
        res-=siz[x]*siz[x];
        siz[x]+=w[i];if(siz[x]>=mods)siz[x]-=mods;
        res+=siz[x]*siz[x];
        res=rdc(res);
    }
    return (res+mods)%mods;
}
int solve(int l,int r){
    if(bh[l]==bh[r])return Solve(l,r);
    clr();
    int ll=bh[l]+1,rr=bh[r]-1,res=f[ll][rr];
    for(int i=st[ll]-1;i>=l;i--){
        res-=dp[i][rr];
        res+=1ll*gs[i][rr]*gs[i][rr];
        res=rdc(res);
    }
    for(int i=ed[rr]+1;i<=r;i++){
        int x=gets(i,l);
        jl.push_back(x);
        res-=1ll*(siz[x]+gs[x][rr])*(siz[x]+gs[x][rr]);
        siz[x]+=w[i];if(siz[x]>=mods)siz[x]-=mods;
        res+=1ll*(siz[x]+gs[x][rr])*(siz[x]+gs[x][rr]);
        res=rdc(res);
    }
    return (res+mods)%mods;
}
signed main(){
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)lg2[i]=__lg(i);
    for(int i=1;i<=n;i++)cin>>w[i];
    for(int i=2;i<=n;i++){
        cin>>fa[i];
        p[fa[i]].push_back(i);
    }
    for(int i=1;i<=n;i++)bh[i]=(i-1)/T+1,st[i]=ed[i-1]+1,ed[i]=min(i*T,n);
    dfs(1);
    dfs(1,1);
    for(int i=1;i<=bh[n];i++){
        memset(siz,0,sizeof(siz));
        for(int j=i;j<=bh[n];j++){
            f[i][j]=f[i][j-1];
            for(int k=st[j];k<=ed[j];k++){
                int c=gets(k,st[i]);
                f[i][j]-=siz[c]*siz[c];
                siz[c]+=w[k];siz[c]%=mods;
                f[i][j]+=siz[c]*siz[c];
                f[i][j]%=mods;
                f[i][j]=(f[i][j]+mods)%mods;
            }
            //cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
        }
    }
    memset(siz,0,sizeof(siz));
    while(m--){
        int l,r;
        cin>>l>>r;
        l^=ans,r^=ans;
        cout<<(ans=solve(l,r))<<"\n";
    }
}