#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e5,L=17,MOD=998244353;
int mad(int&a,int b){if((a+=b)>=MOD)a-=MOD;return a;}
int msb(int&a,int b){if((a-=b)<0)a+=MOD;return a;}
int add(int a,int b){return mad(a,b);}
int sub(int a,int b){return msb(a,b);}
int mul(int a,int b){return(ll)a*b%MOD;}
int mmu(int&a,int b){return a=(ll)a*b%MOD;}
int inv(int a){return a==1?1:mul(inv(MOD%a),MOD-MOD/a);}
int n;
vector<int>g[N];
int dd[N],jj[N][L];
int say[N],way[N],me[N];
int tin[N],tout[N],tt;
int upway[N],upme[N];
int psay[N],pway[N];
void dfs(int i){
    for(int l=1;l<L;l++)jj[i][l]=jj[jj[i][l-1]][l-1];
    say[i]=0,me[i]=1;
    tin[i]=tt++;
    for(int j:g[i]){
        //g[j].erase(find(g[j].begin(),g[j].end(),i));
        jj[j][0]=i;
        dd[j]=dd[i]+1;
        dfs(j);
        mad(say[i],way[j]);
        mmu(me[i],1+me[j]);
    }
    tout[i]=tt-1;
    way[i]=add(say[i],me[i]);
    //cout<<i<<"=>way="<<way[i]<<",say="<<say[i]<<endl;
}
int lca(int i,int j){
    if(dd[i]<dd[j])swap(i,j);
    int d=dd[i]-dd[j];
    for(int l=0;l<L;l++)if(d>>l&1)i=jj[i][l];
    if(i==j)return i;
    for(int l=L-1;l>=0;l--)if(jj[i][l]!=jj[j][l])i=jj[i][l],j=jj[j][l];
    return jj[i][0];
}
bool anc(int i,int j){
    return tin[i]<=tin[j]&&tout[i]>=tout[j];
}
void reroot(int i){
    //cout<<"i="<<i<<",got uway="<<upway[i]<<", ume="<<upme[i]<<endl;
    int nway=upway[i],nme=1+upme[i];
    for(int j:g[i])mad(nway,way[j]),mmu(nme,1+me[j]);
    for(int j:g[i]){
        upme[j]=mul(nme,inv(1+me[j]));
        upway[j]=add(sub(nway,way[j]),upme[j]);
        reroot(j);
    }
}
void make(int i){
    psay[i]=say[i],pway[i]=way[i];
    if(i)mad(psay[i],psay[jj[i][0]]),mad(pway[i],pway[jj[i][0]]);
    for(int j:g[i])make(j);
}
int qry(int i,int j){
    //assert(anc(i,j));
    int a=sub(psay[j],i?psay[jj[i][0]]:0);
    int b=sub(pway[j],pway[i]);
    //cout<<"got "<<a<<' '<<b<<endl;
    return sub(a,b);
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--){
        int q;
        cin>>n>>q;
        for(int i=1;i<n;i++){
            int p;
            cin>>p,p--;
            g[p].push_back(i);
        }
        tt=0;
        dfs(0);
        upway[0]=upme[0]=0;
        reroot(0);
        make(0);
        while(q--){
            int i,j;
            cin>>i>>j,i--,j--;
            if(tin[i]>tin[j])swap(i,j);
            int x=0;
            if(anc(i,j)){
                mad(x,qry(i,j));
                mad(x,upway[i]);
            }else{
                int p=lca(i,j);
                //cout<<"parent="<<p<<endl;
                mad(x,qry(p,i));
                mad(x,qry(p,j));
                msb(x,say[p]);
                mad(x,upway[p]);
                //cout<<"minus "<<say[p]<<", add "<<upme[p]<<endl;
            }
            //cout<<"x="<<x<<endl;
            cout<<sub(way[0],x)<<'\n';
        }
        for(int i=0;i<n;i++){
            g[i].clear();
        }
    }
}