#include<stdio.h>
#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef __int128 int128;
typedef __uint128_t uint128;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=5e5+10;
int n,fa[Max];
ll a[Max];
vector<int>e[Max];
priority_queue<ll>s[Max];
ll ans=0;
void dfs(int u)
{
	s[u].push(a[u]);
	ans+=a[u];
	int cnt=3;
	for(auto v:e[u])
	{
		dfs(v);
		if(s[u].size()<s[v].size())
			s[u].swap(s[v]);
		while(!s[v].empty())
			s[u].push(s[v].top()),s[v].pop();
	}
	while(s[u].top()>a[u]*cnt)
	{
		ans+=a[u]*cnt-s[u].top();
		s[u].pop();
		s[u].push(a[u]*cnt);
		cnt+=2;
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n;
	for(int i=2;i<=n;++i)
		cin>>fa[i],e[fa[i]].push_back(i);
	for(int i=1;i<=n;++i)
		cin>>a[i];
	dfs(1);
	cout<<ans<<"\n";
	return 0;
}