#include "tree.h"
#include<iostream>
#include<cstdio>
#define N 200000
using namespace std;
int n,L,R,fa[N+1];
long long res,A[N+1],B[N+1];
std::vector<int> p, w;
vector<int>E[N+1];
void dfs(int x)
{
	A[x]=B[x]=0;
	for (int i=0;i<E[x].size();++i) dfs(E[x][i]),A[x]+=A[E[x][i]],B[x]+=B[E[x][i]];
	if (B[x]<L) res+=L-B[x],A[x]=B[x]=L;
	else if (A[x]>R) res+=A[x]-R,A[x]=B[x]=R;
	else A[x]=max(A[x],(long long)(L)),B[x]=min(B[x],(long long)(R));
	return;
}
void init(std::vector<int> P, std::vector<int> W)
{
	n=P.size();
	for (int i=1;i<n;++i) E[P[i]].push_back(i);
	return;
}
long long query(int sl, int sr)
{
	L=sl,R=sr,res=0,dfs(0);
	return res;
}