#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

#ifdef ONLINE_JUDGE

#include "tree.h"

#endif

const int N=201000;
int n,lef;
vector<int> p, c;
VI son[N];
map<ll,ll> dp[N];
ll pr[N],ms[N],pl[N],lc;

void init(std::vector<int> P, std::vector<int> W) {
  p = P;
  c = W;
  n = (int)p.size();
  rep(i,1,n) son[p[i]].pb(i);
  rep(i,0,n) {
    if (son[i].empty()) lc+=c[i];
    else lc+=(ll)c[i]*(SZ(son[i])-1);
  }
}

long long query(int L, int R) {
  ll ans=(ll)L*lc;
  function<void(int)> dfs=[&](int u) {
    dp[u].clear();
    pl[u]=pr[u]=0;
    if (son[u].empty()) {
      pl[u]=L;
      pr[u]=L;
      return;
    }
    for (auto v:son[u]) {
      dfs(v);
      pl[u]+=pl[v];
      pr[u]+=pr[v];
      ms[u]+=ms[v];
      if (SZ(dp[v])>SZ(dp[u])) dp[u].swap(dp[v]);
      for (auto [key,val]:dp[v]) dp[u][key]+=val;
    }
    while (!dp[u].empty()&&prev(dp[u].end())->fi>=c[u]) {
      auto it=prev(dp[u].end());
      ans-=(ll)it->se*(it->fi-c[u]);
      pl[u]+=it->se;
      dp[u].erase(prev(dp[u].end()));
    }
    dp[u][c[u]]+=pl[u]-L; pl[u]=L;
  };
  dfs(0); 
  {
    int u=0;
    while (pr[u]>R) {
      ll d=min(pr[u]-R,dp[u].begin()->se);
      pr[u]-=d;
      if (dp[u].begin()->se==d) dp[u].erase(dp[u].begin());
      else dp[u].begin()->se-=d;
    }
  }
  for (auto [key,val]:dp[0]) ans-=(ll)key*val;
  return ans;
}

#ifndef ONLINE_JUDGE

#include <cassert>
#include <cstdio>

int main() {
  int N;
  assert(1 == scanf("%d", &N));
  std::vector<int> P(N);
  P[0] = -1;
  for (int i = 1; i < N; i++)
    assert(1 == scanf("%d", &P[i]));
  std::vector<int> W(N);
  for (int i = 0; i < N; i++)
    assert(1 == scanf("%d", &W[i]));
  int Q;
  assert(1 == scanf("%d", &Q));
  std::vector<int> L(Q), R(Q);
  for (int j = 0; j < Q; j++)
    assert(2 == scanf("%d%d", &L[j], &R[j]));
  fclose(stdin);

  init(P, W);
  std::vector<long long> A(Q);
  for (int j = 0; j < Q; j++)
    A[j] = query(L[j], R[j]);

  for (int j = 0; j < Q; j++)
    printf("%lld\n", A[j]);
  fclose(stdout);

  return 0;
}

#endif