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

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

int n;

vector<vi>E;
vector<ll>C,W;

int cur;
ll lef[100010];
ll dp[100010][2][2][2];

void dfs(int u){
  bool leaf=1;
  for(int v:E[u]){
    dfs(v);
    if(leaf){
      leaf=0;
      rep(i,0,1)rep(j,0,1)rep(l,0,1)rep(r,0,1){
        chkmin(dp[u][i][l][r],dp[v][j][l][r]+(i==j?C[v-1]:0));
      }
      lef[u]=lef[v];
    }else{
      static ll buk[2][2][2];
      memset(buk,0x3f,sizeof buk);
      rep(i,0,1)rep(l,0,1)rep(r,0,1){
        rep(j,0,1)rep(x,0,1)rep(y,0,1){
          chkmin(buk[i][l][y],dp[u][i][l][r]+dp[v][j][x][y]+(i==j?C[v-1]:0)+(r==x?lef[v]:0));
        }
      }
      memcpy(dp[u],buk,sizeof buk);
    }
  }
  if(leaf){
    dp[u][0][0][0]=0;
    dp[u][1][1][1]=0;
    lef[u]=W[cur++];
  }
}

long long place_police(vector<int> P, vector<long long> C, vector<long long> W){
  memset(dp,0x3f,sizeof dp);
  n=P.size()+1;
  E.resize(n);
  rep(i,1,n-1){
    int f=P[i-1];
    E[f].pb(i);
  }
  ::C=C,::W=W;
  dfs(0);
  ll as=1e18;
  rep(i,0,1)rep(l,0,1)rep(r,0,1){
    chkmin(as,dp[0][i][l][r]+(l==r?W.back():0));
  }
  return as;
}

//#include"grader.cpp"