#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5,inf=1e9+7;
int n;
int c[N],v[N],f[N],sum[N];
struct node{
	int l,r,sum=0;
	bool sl=false;
}a[N];
bool hs[N];
vector<vector<int>>d;
int main(){
	freopen("RRR.in","r",stdin);
	freopen("RRR.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
	for(int i=1;i<=n;i++) scanf("%d",&v[i]);
	for(int i=1;i<=n;i++) scanf("%d",&f[i]);
	for(int i=1;i<=n;i++){
		if(!hs[c[i]]){
			hs[c[i]]=1;
			a[c[i]].l=i;	
		}
		a[c[i]].sum+=v[i];
		a[c[i]].sl=true;
	}
	memset(hs,false,sizeof(hs));
	for(int i=n;i>=1;i--){
		if(!hs[c[i]]){
			a[c[i]].r=i;
			hs[c[i]]=1;
		}
	}
	for(int i=1;i<=n;i++){
		if(a[i].sl){
			for(int j=1;j<=n;j++){
				if(i!=j&&a[i].sl){
					if((a[i].l<=a[j].l&&a[j].r<=a[i].r)||(a[j].l<=a[i].l&&a[i].r<=a[j].r)){
						bool isy=false;
						for(int k:d[i]){
							if(k==j){
								isy=true;
								break;
							}
						}
						if(isy) continue;
						d[i].push_back(j);
						sum[i]+=a[j].sum;
					}
				}
			}
		}
	}
	int ans=inf;
	for(int i=1;i<=n;i++){
		if(a[i].sl){
			ans=min(ans,sum[i]);
		}
	}
	printf("%d\n",ans);
	return 0;
}