#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

#define NMAX 100002
#define pb push_back
#define sz size()

vector<int> G[NMAX];
int P[NMAX],C[NMAX];
int A[NMAX];
int N;

void DF(int nod)
{
	P[nod]=A[nod];
	for (int i=0;i<G[nod].sz;i++)
		{
			DF( G[nod][i] );
			P[nod] += P[ G[nod][i] ];
		}		
}

int cmp(int x, int y)
{
	return P[x]>P[y];
}

void COMP(int nod)
{
	C[nod]=0;
	int i;

	for (i=0;i<G[nod].sz;i++)
		{
			COMP( G[nod][i] );
			C[nod] += C[ G[nod][i] ];
		}

	sort( G[nod].begin(), G[nod].end(),cmp );
	for (i=0;i<G[nod].sz;i++)
		C[nod]+= (P[ G[nod][i] ]*(i+1) );
	
}

int main()
{
	freopen("dosare.in","r",stdin);
	freopen("dosare.out","w",stdout);

	int i,x;

	scanf("%d ",&N);

	for (i=2;i<=N;i++)
	{
		scanf("%d ",&x);
		G[x].pb(i);
	}

	int S=0;
	for (i=1;i<=N;i++)
	{
		scanf("%d ",&A[i]);
		S+=A[i];
	}

	DF(1);
	COMP(1);
	
//	for (i=1;i<=N;i++) printf("%d %d\n",P[i],C[i]);

	printf("%d",C[1]+S);
	return 0;
}