#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define nmax 16010
#define f first
#define s second

int n;
vector < int> G[nmax];
pair <long long , long long > v[nmax];

int cmp(int x, int y)
{
	return v[x].s+v[x].f>v[y].s+v[y].f;
}

void dfs(int nod)
{
	if (!G[nod].size()) 
	{
		v[nod].s=0;
		return;
	}
	int i;
	for (i=0; i<G[nod].size(); i++) dfs(G[nod][i]);
	sort(G[nod].begin(), G[nod].end(), cmp);
	int c=0;
	for (i=0; i<G[nod].size(); i++)
	{
		v[nod].f+=v[G[nod][i]].f;
		c++;
		v[nod].s+=c*v[G[nod][i]].f+v[G[nod][i]].s;
	}
}

int main()
{
	freopen("dosare.in","r",stdin);
	freopen("dosare.out","w",stdout);
	scanf("%d",&n);
	int i, x;
	long long s=0;
	for (i=2; i<=n; i++)
	{
		scanf("%d",&x);
		G[x].push_back(i);
	}
	for (i=1; i<=n; i++) 
	{
		scanf("%lld",&v[i].f);
		s+=v[i].f;
	}
	dfs(1);
	printf("%lld\n",v[1].s+s);
}