#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll _=5e5+5;
vector<ll>v[_];
ll n,f[_],a[_],s;
priority_queue<ll>q[_];
void dfs(ll x){
	q[x].push(a[x]);s+=a[x];ll c=3;
	for(auto y:v[x]){
		dfs(y);
		if(q[x].size()<q[y].size())q[x].swap(q[y]);
		while(q[y].size())q[x].push(q[y].top()),q[y].pop();
	}
	while(q[x].top()>a[x]*c){
		s+=a[x]*c-q[x].top();
		q[x].pop();q[x].push(a[x]*c);c+=2;
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(ll i=2;i<=n;i++)cin>>f[i],v[f[i]].push_back(i);
	for(ll i=1;i<=n;i++)cin>>a[i];
	dfs(1);
	cout<<s<<'\n';
	return 0;
}