#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N, Q;
vector<Mint> A;
vector<int> P;

Mint brute(int L, int R) {
  static Mint dp[5010];
  copy(A.begin() + L, A.begin() + R, dp + L);
  Mint ans = 0;
  for (int u = R; --u >= L; ) {
    if (P[u] < L) {
      ans += dp[u] * dp[u];
    } else {
      dp[P[u]] += dp[u];
    }
  }
  return ans;
}


// long path decomposition
// assumes P[u] < u
namespace la {
constexpr int E = 18;
int pp[E][1 << E];
vector<vector<int>> graph;
vector<int> dep, hei;
int seqLen;
vector<int> seq;
vector<int> head;
vector<int> pt;
void build() {
  copy(P.begin(), P.end(), pp[0]);
  for (int e = 0; e < E - 1; ++e) for (int u = 0; u < N; ++u) pp[e + 1][u] = (~pp[e][u]) ? pp[e][pp[e][u]] : -1;
  graph.assign(N, {});
  for (int u = 1; u < N; ++u) graph[P[u]].push_back(u);
  dep.assign(N, 0);
  for (int u = 1; u < N; ++u) dep[u] = dep[P[u]] + 1;
  hei.assign(N, 0);
  for (int u = N; --u >= 1; ) chmax(hei[P[u]], 1 + hei[u]);
  for (int u = 0; u < N; ++u) for (int j = 0; j < (int)graph[u].size(); ++j) if (hei[graph[u][0]] < hei[graph[u][j]]) swap(graph[u][0], graph[u][j]);
  seqLen = 0;
  seq.assign(2 * N, -1);
  pt.assign(N, -1);
  head.assign(N, -1);
  for (int u = 0; u < N; ++u) if (!~head[u]) {
    const int below = 1 + hei[u];
    const int above = min(dep[u], below);
    pt[u] = seqLen + above;
    seqLen += (above + below);
    head[seq[pt[u]] = u] = u;
    for (int x = 1; x <= above; ++x) seq[pt[u] - x] = P[seq[pt[u] - x + 1]];
    for (int x = 1; x < below; ++x) head[seq[pt[u] + x] = graph[seq[pt[u] + x - 1]][0]] = u;
  }
// cerr<<"graph = "<<graph<<endl;
// cerr<<"seq = "<<seq<<endl;
// cerr<<"pt = "<<pt<<endl;
// cerr<<"head = "<<head<<endl;
}
int jumpUp(int u, int d) {
  assert(0 <= u); assert(u < N);
  assert(d >= 0);
  if (dep[u] < d) return -1;
  if (d == 0) return u;
  const int e = 31 - __builtin_clz(d);
  const int v = head[pp[e][u]];
  return seq[pt[v] - dep[v] + (dep[u] - d)];
}
}  // la


constexpr int K = 550;
vector<vector<Mint>> f, g;

int qid;
vector<int> app;
vector<Mint> fs;

void build() {
  la::build();
// for(int u=0;u<N;++u)for(int d=0;d<N;++d)cerr<<u<<" "<<d<<": "<<la::jumpUp(u,d)<<endl;
  
  f.assign(N / K + 1, {});
  g.assign(N / K + 1, {});
  for (int x = 0; x <= N / K; ++x) {
    const int r = x * K;
    f[x].assign(r + 1, 0);
    g[x].assign(r + 1, 0);
    for (int u = 0; u < r; ++u) f[x][u] = A[u];
    for (int u = r; --u >= 1; ) f[x][P[u]] += f[x][u];
    for (int u = 0; u < r; ++u) g[x][u + 1] = g[x][u] + f[x][u] * f[x][u];
  }
  
  qid = 0;
  app.assign(N, 0);
  fs.assign(N, 0);
}

Mint query(int L, int R) {
  ++qid;
  const int M = lower_bound(P.begin() + L, P.begin() + R, L) - P.begin();
  const int x = R / K;
  const int r = x * K;
  Mint ans = 0;
  if (L < min(M, r)) {
    ans += g[x][min(M, r)] - g[x][L];
  }
  for (int u = max(L, r); u < R; ++u) {
    int v = la::jumpUp(u, max(la::dep[u] - la::dep[L] - 1, 0));
    if (L <= P[v]) v = P[v];
    if (app[v] != qid) {
      app[v] = qid;
      fs[v] = (v < r) ? f[x][v] : 0;
    }
// cerr<<"u = "<<u<<": v = "<<v<<"; "<<fs[v]<<" -> "<<(fs[v]+A[u])<<endl;
    ans += A[u] * (fs[v] + fs[v] + A[u]);
    fs[v] += A[u];
  }
  return ans;
}


int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    A.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%u", &A[u].x);
    }
    P.resize(N);
    for (int u = 1; u < N; ++u) {
      scanf("%d", &P[u]);
      --P[u];
    }
    P[0] = -1;
    
    build();
    
    int lst = 0;
    for (int q = 0; q < Q; ++q) {
      int L, R;
      scanf("%d%d", &L, &R);
      L ^= lst;
      R ^= lst;
      --L;
// cerr<<COLOR("33")<<"query ["<<L<<", "<<R<<")"<<COLOR()<<endl;
      const Mint ans = query(L, R);
      printf("%u\n", ans.x);
#ifdef LOCAL
if(N<=5000){
 const Mint brt=brute(L,R);
 if(brt!=ans)cerr<<L<<" "<<R<<": "<<brt<<" "<<ans<<endl;
 assert(brt==ans);
}
#endif
#ifdef LOCAL
if(N==250000)continue;
#endif
      lst = ans.x;
    }
  }
  return 0;
}