#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP make_pair
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
namespace {
    const ll MAXN=1e5;
    const ll INF = 1e18;
    pll leaf[MAXN+100];
    ll dp[MAXN+100][2][2][2];
    ll cost[MAXN+100];
    ll w[MAXN+100];
    vector <ll> g[MAXN+100];
    ll ptr_leaf;
    vector <ll> W_leaf;
    bool color[MAXN+100];
    void dfs_init(ll u){
        for (auto v:g[u]){
            color[v] = 1-color[u];
            dfs_init(v);
            if (leaf[u].fi==0)leaf[u].fi = leaf[v].fi;
            leaf[u].se = leaf[v].se;
        }
        if (sz(g[u])==0){
            leaf[u] = MP(u,u);
            cost[u] = W_leaf[ptr_leaf++];
        }
    }
    void dfs_solve(ll u){
        bool true_leaf = 1;
        ll last = -1;
        for (auto v:g[u]){

            dfs_solve(v);
            if (true_leaf){
                for (ll i = 0;i < 2;i ++)for (ll j = 0;j < 2;j ++)for (ll k = 0;k < 2;k ++)dp[u][i][j][k] = dp[v][i][j][k];
                for (ll i = 0;i < 2;i ++)for (ll j = 0;j < 2;j ++)for (ll k = 0;k < 2;k ++){
                    dp[u][0][0][k] = min(dp[u][0][0][k],dp[v][i][j][k] + w[v]);
                }
            }
            else{
                ll tmp[2][2][2];
                for (ll i1 = 0;i1 < 2;i1 ++)for (ll j1 = 0;j1 < 2;j1 ++)for (ll k1 = 0;k1 < 2;k1 ++)tmp[i1][j1][k1] = INF;
                for (ll i1 = 0;i1 < 2;i1 ++)for (ll j1 = 0;j1 < 2;j1 ++)for (ll k1 = 0;k1 < 2;k1 ++){
                for (ll i2 = 0;i2 < 2;i2 ++)for (ll j2 = 0;j2 < 2;j2 ++)for (ll k2 = 0;k2 < 2;k2 ++){
                    if (!(i2 && j1 && (color[last] == color[leaf[v].fi])))tmp[i1][j2][k1&&k2] = min(tmp[i1][j2][k1&&k2],dp[u][i1][j1][k1] + dp[v][i2][j2][k2]);
                    tmp[i1][0][k1&&k2] = min(tmp[i1][0][k1&&k2],dp[u][i1][j1][k1] + dp[v][i2][j2][k2] + w[v]);
//                    if (k1 &&k2==0 && tmp[i1][j2][0] != INF && tmp[i1][j2][0] != 9){
//                        cout<<"BRUH "<<i1<<' '<<j2<<' '<<0<<' '<<tmp[i1][j2][0]<<endl;
//                        cout<<k1<<' '<<k2<<' '<<dp[u][i1][j1][k1] + dp[v][i2][j2][k2] + (i2 && j1 && (color[last] == color[leaf[v].fi])) * w[v]<<' '<<dp[u][i1][j1][k1]<<' '<<dp[v][i2][j2][k2]<<'\n';
//                        assert(0);
//                    }

                    tmp[i1][j2][0] = min(tmp[i1][j2][0],dp[u][i1][j1][k1] + dp[v][i2][j2][k2] + cost[last]);
                    tmp[i1][0][0] = min(tmp[i1][0][0],dp[u][i1][j1][k1] + dp[v][i2][j2][k2] + cost[last] + w[v]);
//                    if (cost[last] != 9){
//                        cout<<last<<' '<<cost[last]<<endl;
//                        assert(0);
//                    }
                }
                }
                for (ll i1 = 0;i1 < 2;i1 ++)for (ll j1 = 0;j1 < 2;j1 ++)for (ll k1 = 0;k1 < 2;k1 ++)dp[u][i1][j1][k1] = tmp[i1][j1][k1];
            }
            last = leaf[v].se;
            true_leaf = 0;
        }
        if (true_leaf){
            for (ll i1 = 0;i1 < 2;i1 ++)for (ll j1 = 0;j1 < 2;j1 ++)for (ll k1 = 0;k1 < 2;k1 ++)dp[u][i1][j1][k1] = INF;
            dp[u][1][1][1] = 0;
        }
//        for (ll i = 0;i < 2;i ++)for (ll j = 0;j < 2;j ++)for (ll k = 0;k < 2;k ++)cout<<"DP "<<u<<' '<<i<<' '<<j<<' '<<k<<" = "<<dp[u][i][j][k]<<'\n';
//        cout<<'\n';
    }
}
long long place_police(vector<int> P, vector<long long> C, vector<long long> W){
    W_leaf = W;
    ll n = sz(P) + 1;
    for (ll i = 0;i < n - 1;i ++){
        ll u = i + 2;
        ll v = P[i] + 1;
        g[v].push_back(u);
    }
    for (ll i = 0;i < n - 1;i ++){
        w[i+2] = C[i];
    }
    dfs_init(1);
    dfs_solve(1);
    ll res = INF;
//    cout<<cost[leaf[1].se]<<endl;
    for (ll i = 0;i < 2;i ++)for (ll j = 0;j < 2;j ++)for (ll k = 0;k < 2;k ++)res = min(res,dp[1][i][j][k] + ((i&&j&&(color[leaf[1].fi] == color[leaf[1].se]))||(k && sz(W) % 2))*cost[leaf[1].se]);
    return res;
}