#include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
int n, x, i, j, a[16002], k;
long long nr[16002], s, v[16002], aux;
int cmp (long long a, long long b)
{
    return (a>b);
}
int main ()
{
    freopen("dosare.in", "r", stdin);
    freopen("dosare.out", "w", stdout);

    scanf("%d", &n);
    a[1]=0;
    for (i=2; i<=n; i++){
        scanf("%d", &a[i]);
    }
    sort(a+1, a+n+1);

    for (i=1; i<=n; i++){
        scanf("%d", &x);
        aux=a[i];
        nr[i]+=x;
        while (aux){
            nr[aux]+=x;
            aux=a[aux];
        }
    }
    i=1;
    while (i<=n){
        k=0;
        do{
            v[++k]=nr[i];
            i++;
        }while (a[i]==a[i-1]);
        sort(v+1, v+k+1, cmp);
        for (j=1; j<=k; j++)
            s=s+(v[j]*j);
    }
    printf("%lld", s);
    return 0;
}