#include <bits/stdc++.h>
using namespace std;

using ll  = long long;
using pii = pair<int, int>;

#define fi       first
#define se       second
#define All(x)   x.begin(), x.end()
#define debug(x) cout << #x << " = " << (x) << '\n';

const int iINF = 1'000'000'000;
const ll INF   = 1'000'000'000'000'000'000;

struct FenwickTree {
    int n;
    vector<ll> BIT;

    FenwickTree(int n) : n(n) {
        BIT.assign(n+1, 0);
    }

    void update(int idx, ll val) {
        for (; idx <= n; idx += (idx & -idx)) {
            BIT[idx] += val;
        }
    }

    ll sum(int idx) {
        ll ret = 0;
        for (; idx > 0; idx -= (idx & -idx)) {
            ret += BIT[idx];
        }
        return ret;
    }

    ll query(int l, int r) {
        return sum(r) - sum(l-1);
    }
};

const int maxN  = 100'023;

int N, Q;
ll C[maxN];
vector<int> children[maxN];
vector<pii> queries[maxN];
ll ans[maxN];

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    cin >> N >> Q;
    for (int i = 1; i <= N; i++) cin >> C[i];
    for (int p, i = 2; i <= N; i++) {
        cin >> p;
        children[p].push_back(i);
    }

    for (int l, r, i = 1; i <= Q; i++) {
        cin >> l >> r;
        queries[l].push_back({r, i});
    }
    
    FenwickTree F(N);
    for (int i = N; i >= 1; i--) {
        ll cur = C[i];
        for (auto c : children[i]) {
            ll tmp = F.query(c, c);
            cur += tmp;
            F.update(c, -tmp);
        }
        F.update(i, cur);
        // cout << i << " " << cur << '\n';

        for (auto [j, idx] : queries[i]) {
            ans[idx] = F.query(i, j);
        }
    }

    for (int i = 1; i <= Q; i++) cout << ans[i] << '\n';
}