#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;
typedef pair<int,int> pii;
const int N=200003,INF=0x3f3f3f3f;
int n;ll L,R;
vi vec[N];
vi w;ll dlt;
ll ans[N];
int f[N];
int rt(int x){
	if(f[x]==x) return x;
	return f[x]=rt(f[x]);
}
int dfn[N],sz[N],num;
void dfs(int u){
	sz[u]=1;dfn[u]=++num;
	for(int v:vec[u]) dfs(v),sz[u]+=sz[v];
}
int tr[N];
void upd(int x,int v){while(x) tr[x]+=v,x^=(x&-x);}
int qry(int x){
	int res=0;
	while(x<=n) res+=tr[x],x+=(x&-x);
	return res;
}
int calc(int x){return qry(dfn[x])-qry(dfn[x]+sz[x]);}
void init(vi P,vi W){
	int las=0,cnt=0;num=0;
	n=P.size();w=W;dlt=0;
	vi key(n,1),tim(n),sz(n),tp(n),del(n);
	vector<pii> seq;
	for(int i=1;i<=n;++i) tr[i]=0;
	for(int i=1;i<n;++i) key[P[i]]=0,vec[P[i]].emplace_back(i);
	dfs(0);
	for(int i=n-1;~i;--i){
		if(key[i]) upd(dfn[i],1),dlt+=w[i],++cnt;
		else seq.emplace_back(w[i],i);
		f[i]=i;
	}
	for(int i=0;i<=n;++i) ans[i]=0;
	sort(ALL(seq),greater<pii>());
	for(auto [v,x]:seq){
		if(x&&del[P[x]]) f[x]=P[x];
		del[x]=1;tp[x]=rt(x);
	}
	reverse(ALL(seq));
	for(auto [v,x]:seq){
		dlt+=(ll)(v-las)*cnt++;las=v;
		key[x]=1;
		for(int i:vec[x]) tim[i]=v;
		int p=tp[x];
		ans[calc(p)]+=v-tim[p];tim[p]=v;
		int sx=calc(x);
		upd(dfn[x],1-sx);
		if(p) upd(dfn[P[p]],sx-1);
	}
	for(int i=0;i<n;++i) ans[calc(i)]+=las-tim[i];
}
ll query(int _L,int _R){
	L=_L;R=_R;ll res=dlt*L;
	for(int i=1;i<=n;++i) res-=min(L*i,R)*ans[i];
	return res;
}