#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cassert>
#include <map>
#define ll long long
#define inf 1000000000000000000ll
using namespace std;
int n,depth[100005];
vector<int> e[100005];
vector<ll> c,w;
int l[100005],r[100005];
int tot,id[100005],o[100005];
ll a[100005];
int m,u[100005],v[100005];
ll val[100005];
void dfs(int now,ll s){
	if (e[now].size()==0){
		l[now]=tot;
		id[tot]=now;
		++tot;
		r[now]=tot;
		u[m]=l[now],v[m]=r[now],val[m]=s;
		m++;
		return;
	}
	l[now]=tot;
	for (int i=0;i<(int)e[now].size();i++)
		if (e[now].size()>1)dfs(e[now][i],c[e[now][i]]);
		else dfs(e[now][i],min(s,c[e[now][i]]));
	r[now]=tot;
	if (now!=0&&e[now].size()>1){
		u[m]=l[now],v[m]=r[now],val[m]=s;
		m++;
	}
	return;
}
int dsu[100005],t[100005];
ll mn[100005];
int dsu_find(int x){
	if (x==dsu[x])return x;
}
ll place_police(vector<int> P, vector<ll> _c, vector<ll> _w){
	n=(int)P.size()+1;
	for (int i=1;i<n;i++)e[P[i-1]].push_back(i),depth[i]=depth[P[i-1]]+1;
	c.resize(n);
	c[0]=inf;
	for (int i=1;i<n;i++)c[i]=_c[i-1]; 
	w=_w;
	dfs(0,inf);
	for (int i=0;i<tot;i++)
		if ((depth[id[i]]&1)==(depth[id[(i+1)%tot]]&1))o[(i+1)%tot]=1,a[(i+1)%tot]=w[i];
		else o[(i+1)%tot]=0,a[(i+1)%tot]=w[i];
	ll ans=inf;
	for (int i=0;i<(1<<m);i++){
		for (int j=0;j<tot;j++)dsu[j]=j,t[j]=o[j],mn[j]=a[j];
		ll s=0;
		for (int j=0;j<m;j++){
			if (!(i&(1<<j)))continue;
			s+=val[j];
			int x=dsu_find(u[j]),y=dsu_find(v[j]);
			if (x!=y){
				t[x]^=t[y],mn[x]=min(mn[x],mn[y]);
				t[y]=mn[y]=0;
				dsu[y]=x;
			} 
		}
		for (int j=0;j<tot;j++)
			if (j==dsu_find(j))
				if (t[j]==1)s+=mn[j];
		ans=min(ans,s);
	}
	return ans;
}