#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(...) __VA_ARGS__;
#else
#define debug(...) 24;
#endif

template<class A, class B>
ostream& operator<<(ostream &os, const pair<A, B> &p);
template<class T>
ostream& operator<<(ostream &os, const vector<T> &v);
template<class T, size_t sz>
ostream& operator<<(ostream &os, const array<T, sz> &v);

template<class A, class B>
ostream& operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ',' << p.second << ')';
}

template<class T>
ostream& operator<<(ostream &os, const vector<T> &v) {
  os << '{';
  bool f = 0; for(auto &i : v) { if(f) os << ',';os << i; f = 1;}
  return os << '}';
}

template<class T, size_t sz>
ostream& operator<<(ostream &os, const array<T, sz> &v) {
  os << '{';
  bool f = 0; for(auto &i : v) { if(f) os << ',';os << i; f = 1;}
  return os << '}';
}

const int N = 1e5+5;
struct Segtree {
  int n = 0;
  vector<int> st;
#define lc (idx << 1)
#define rc (lc | 1)
#define mid ((l+r)>>1)
  Segtree() {}
  Segtree(int n) { init(n); }
  void init(int _n) {
    n = _n;
    st.assign(4*n, 0);
  }
  int pull(int lt, int rt) {
    return lt + rt;
  }
  void update(int idx, int l, int r, int x, int val) {
    debug(cerr << "update " << idx << ' ' << l << ' ' << r << ' ' << x << ' ' << val << '\n');
    if(l == r) {
      st[idx] = val;
      return;
    }
    if(x <= mid) update(lc, l, mid, x, val);
    else update(rc, mid+1, r, x, val);
    st[idx] = pull(st[lc], st[rc]);
  }
  void update(int i, int val) {
    debug(cerr << "update " << i << ' ' << val << '\n');
    return update(1, 1, n, i, val);
  }
  int query(int idx, int l, int r, int x, int y) {
    if(r < x || y < l) return 0;
    if(x <= l && r <= y) return st[idx];
    return pull(query(lc, l, mid, x, y),
                query(rc, mid+1, r, x, y));
  }
  int query(int l, int r) {
    debug(cerr << "query " << l << ' ' << r << '\n');
    return query(1, 1, n, l, r);
  }
  void print(int idx, int l, int r) {
    cerr << '(' << l << ',' << r << ')' << ' ' << st[idx] << '\n';
    if(l == r) return;
    print(lc, l, mid); print(rc, mid+1, r);
  }
  void print() {
    return print(1, 1, n);
  }
#undef lc
#undef rc
#undef mid
};

using pii = pair<int, int>;
#define fi first
#define se second
int n, q;
int a[N];
vector<int> adj[N];
vector<pii> queries[N];

void dfs(int u) {
  for(int v : adj[u]) {
    dfs(v);
    a[u] += a[v];
  }
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n >> q;
  for(int i = 1; i <= n; i++) cin >> a[i];
  for(int i = 2; i <= n; i++) {
    int p; cin >> p;
    adj[p].push_back(i);
  }
  for(int i = 0; i < q; i++) {
    int l, r; cin >> l >> r;
    queries[l].emplace_back(r, i);
  }
  debug(cerr << vector(a+1, a+1+n) << '\n');
  dfs(1);
  debug(cerr << vector(a+1, a+1+n) << '\n');
  Segtree st(n);
  st.update(1, a[1]);
  vector<int> ans(q);
  for(int i = 1; i <= n; i++) {
    debug(st.print());
    for(auto [j, id] : queries[i]) {
      ans[id] = st.query(i, j);
    }
    debug(cerr << " ------- " << '\n');
    for(int v : adj[i]) st.update(v, a[v]);
  }
  for(int i = 0; i < q; i++)
    cout << ans[i] << '\n';
}