#include<bits/stdc++.h>
using namespace std;
int n,fa[200005],w[200005],deg[200005];
int gd,fl,lf;
long long S[200005];
int sz[200005];
int q[200005],qq[200005];
void init(vector<int>P,vector<int>W){
	n=P.size();
	for(int i=0;i<n;++i)fa[i]=P[i],w[i]=W[i],deg[i]=0;
	for(int i=1;i<n;++i)++deg[fa[i]];
	for(int i=0;i<n;++i)sz[i]=(deg[i]==0);
	for(int i=n-1;i>=1;--i)sz[fa[i]]+=sz[i];
	gd=0;fl=1;lf=1;
	for(int i=0;i<n;++i)fl&=(w[i]==1);
	for(int i=0;i<n;++i)gd+=(deg[i]==0);
	for(int i=1;i<=n;++i)S[i]=0;
	for(int i=1;i<n;++i)S[sz[i]]+=sz[i],S[sz[fa[i]]]-=sz[i];
	for(int i=1;i<=n;++i)S[i]+=S[i-1];
	for(int i=0;i<n;++i)q[i]=i;
	for(int i=1;i<n;++i)lf&=(w[fa[i]]<=w[i]);
	sort(q,q+n,[&](int x,int y){
		return w[x]<w[y];
	});
	for(int i=0;i<n;++i)qq[q[i]]=i;
}
long long c[200005];
long long A[200005],B[200005];
int id[200005];
long long sm[8000005],s2[8000005];
int ls[8000005],rs[8000005],tot;
void add(int x,int l,int r,int y,long long z){
	if(l==r){
		sm[x]+=z;s2[x]+=w[q[y]]*z;
		return;
	}
	int mid=(l+r)>>1;
	if(y<=mid){
		if(!ls[x])ls[x]=++tot;
		add(ls[x],l,mid,y,z);
	}else{
		if(!rs[x])rs[x]=++tot;
		add(rs[x],mid+1,r,y,z);
	}
	sm[x]=sm[ls[x]]+sm[rs[x]];
	s2[x]=s2[ls[x]]+s2[rs[x]];
}
int merg(int x,int y,int l,int r){
	if(!x||!y)return x+y;
	if(l==r){
		int z=++tot;
		sm[z]=sm[x]+sm[y];
		s2[z]=s2[x]+s2[y];
		return z;
	}
	int mid=(l+r)>>1,z=++tot;
	ls[z]=merg(ls[x],ls[y],l,mid);
	rs[z]=merg(rs[x],rs[y],mid+1,r);
	sm[z]=sm[ls[z]]+sm[rs[z]];
	s2[z]=s2[ls[z]]+s2[rs[z]];
	return z;
}
void qing(int x){
	sm[x]=s2[x]=0;
	ls[x]=rs[x]=0;
}
void clr(int x,int l,int r,int ll,int rr){
	if(!x)return;
	if(l>=ll&&r<=rr){
		qing(x);
		return;
	}
	int mid=(l+r)>>1;
	if(mid>=ll)clr(ls[x],l,mid,ll,rr);
	if(mid<rr)clr(rs[x],mid+1,r,ll,rr);
	sm[x]=sm[ls[x]]+sm[rs[x]];
	s2[x]=s2[ls[x]]+s2[rs[x]];
}
long long gett(int x,int l,int r,long long &k){
	if(!k||!sm[x])return 0;
	if(k>=sm[x]){
		k-=sm[x];
		long long a2=s2[x];
		qing(x);
		return a2;
	}
	if(l==r){
		long long a2=k*w[q[l]];
		sm[x]-=k;s2[x]-=k*w[q[l]];
		k=0;
		return a2;
	}
	int mid=(l+r)>>1;
	long long a1=gett(ls[x],l,mid,k);
	a1+=gett(rs[x],mid+1,r,k);
	sm[x]=sm[ls[x]]+sm[rs[x]];
	s2[x]=s2[ls[x]]+s2[rs[x]];
	return a1;
}
void shan(int x,int l,int r,long long &k){
	if(!k||!sm[x])return;
	if(k>=sm[x]){
		k-=sm[x];
		qing(x);
		return;
	}
	if(l==r){
		assert(k>=sm[x]);
		sm[x]-=k;s2[x]-=k*w[q[l]];
		k=0;
		return;
	}
	int mid=(l+r)>>1;
	shan(rs[x],mid+1,r,k);
	shan(ls[x],l,mid,k);
	sm[x]=sm[ls[x]]+sm[rs[x]];
	s2[x]=s2[ls[x]]+s2[rs[x]];
}
long long query(int L,int R){
	if(fl){
		int m=R/L;
		long long ans=(gd+S[min(m,n)])*L-R*(gd>m);
		return ans;
	}
	for(int i=0;i<n;++i)c[i]=0;
	long long ans=0;
	for(int i=n-1;i>=0;--i){
		long long cj=0;
		if(c[i]>R)cj=c[i]-R;
		else if(c[i]<L)cj=c[i]-L;
		c[i]-=cj;
		if(i)c[fa[i]]+=c[i];
		if(deg[i]==0){
			ans+=(-cj)*w[i];
			A[i]=0;
			continue;
		}
		A[i]=cj;B[i]=c[i]-L;
	}
	if(lf){
		for(int i=0;i<n;++i)ans+=A[i]*w[i];
		return ans;
	}
	for(int i=1;i<=tot;++i)sm[i]=s2[i]=ls[i]=rs[i]=0;
	for(int i=0;i<n;++i)id[i]=i+1;
	tot=n;
	for(int i=n-1;i>=0;--i){
		add(id[i],0,n-1,qq[i],A[i]);
		long long c=min(sm[id[i]],A[i]);
		ans+=gett(id[i],0,n-1,c);
		clr(id[i],0,n-1,qq[i],n-1);
		if(sm[id[i]]<=B[i]){
			add(id[i],0,n-1,qq[i],B[i]-sm[id[i]]);
		}else{
			long long c=sm[id[i]]-B[i];
			shan(id[i],0,n-1,c);
		}
		if(i)id[fa[i]]=merg(id[fa[i]],id[i],0,n-1);
	}
	return ans;
}
#ifndef ONLINE_JUDGE
int main(){
	init({-1,0,0,1,2,2,1,0}, {2,2,2,2,2,2,2,2});
	cout<<query(175,777)<<endl;
	return 0;
}
#endif