#include<bits/stdc++.h>
using namespace std;

#define pb push_back
using ll = long long;
const int N = 15;

vector<int> G[N];
ll ans = 2e9;
int n;
ll c[N];
int vis[N];
bool col[N];

void dfs(int u, int tp, int d){
    if(d == tp) return; 
    for(int &v : G[u]){
        col[v] = 1;
        dfs(v, tp, d + 1);
    }
}

inline void solve1(){
    for(int cnt = 1;cnt <= 3000;cnt ++){
        for(int mask = 0;mask < (1 << n);mask ++){
            for(int i = 0;i < n;i ++){
                vis[i + 1] = (mask >> i) & 1;
                if(vis[i + 1]) vis[i + 1] = rand() % 8;
                col[i + 1] = 0; 
            }
            dfs(1, 1, 1);
            for(int i = 1;i <= n;i ++){
//                cout << vis[i] << ' ';
                if(vis[i]){
                    col[i] = 1;
                    dfs(i, vis[i], 0);
                }
            }
//            cout << '\n';
            ll cnt = 0;
            bool flag = 1;
            for(int i = 1;i <= n;i ++){
                if(vis[i]) cnt += c[i] * vis[i];
                if(!col[i]) flag = 0;
            }
            if(flag) ans = min(ans, cnt);
        }
    }
}

int main(){
    freopen("sweet.in", "r", stdin);
    freopen("sweet.out", "w", stdout);
    cin.tie(0) -> ios::sync_with_stdio(0);
    cin >> n;
    for(int i = 1;i < n;i ++){
        int p; cin >> p;
        G[p].pb(i + 1);
        G[i + 1].pb(p);
    }
    for(int i = 1;i <= n;i ++){
        cin >> c[i];
    }
    if(n <= 15){
        srand(time(0));
        solve1();
        cout << ans << '\n';
    } 
    return 0;
}