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

int n;
std::vector<int> p, w;

vector<vector<int>> adj; 
vector<int> dp , co; 

void dfs(int node , int par , int l , int r){
  for (auto i : adj[node]){
    dfs(i , node , l , r); 
    dp[node] += dp[i];    
  }
  if (dp[node] >= l && dp[node] <= r) {}
  else if (dp[node] < l) co[node] += l - dp[node] , dp[node] = l;
  else if (dp[node] > r) co[node] += dp[node] - r , dp[node] = r;
}

void init(std::vector<int> P, std::vector<int> W) {
  p = P;
  w = W;
  n = (int)p.size();
  adj.assign(n , {});
  for (int i = 1 ; i < n ; i++){
    adj[p[i]].push_back(i); 
  }
 
}

long long query(int L, int R) {
  dp.assign(n , 0); 
  co.assign(n,  0);
  dfs(0 , -1 , L , R);
  long long ans = 0;
  for (int i = 0 ; i < n ; i++) ans += abs(co[i]) * w[i];
  return ans;
}