#include "tree.h"
#include <set>
#include <cstdio>
#include <cassert>
#include <algorithm>
#define ALL(vc) (vc).begin(),(vc).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int N=200003,INF=0x3f3f3f3f;
int n;ll L,R;
vi vec[N];
vi w;ll dlt;
ll sm[N],c[N];
ll dfs(int u,int x){
	ll cur=0;
	if(vec[u].empty()) sm[u]=c[u]=L;
	else{
		sm[u]=c[u]=0;
		for(int v:vec[u]){
			cur+=dfs(v,x);
			sm[u]+=sm[v];
			c[u]+=c[v];
		}
		if(w[u]<x) c[u]=0;
		if(sm[u]>R){
			sm[u]=R;
			if(c[u]>R) cur+=c[u]-R,c[u]=R;
		}
		c[u]=max(c[u],L);
	}
	return cur;
}
vi seq;
void init(vi P,vi W){
	n=P.size();w=W;seq=W;seq.emplace_back(0);dlt=0;
	sort(ALL(seq));seq.erase(unique(ALL(seq)),seq.end());
	for(int i=1;i<n;++i) vec[P[i]].emplace_back(i);
	for(int i=0;i<n;++i) if(vec[i].empty()) dlt+=w[i];
}
ll query(int _L,int _R){
	L=_L;R=_R;ll res=dlt*L;
	int sz=seq.size();
	for(int i=1;i<sz;++i) res+=(seq[i]-seq[i-1])*dfs(0,seq[i]);
	return res;
}