#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
int w[N],w1[N];
ll n,c[N],v[N],f[N],ans=1000000000;
bool pd(int l,int r)
{
    memset(w1,0,sizeof(w1));
    for(int i=l;i<=r;i++){
        w1[c[i]]++;
        if(w1[c[i]]==w[c[i]]) return true;
    }
    return false;
}
ll q(int l,int r)
{
    ll sum=0;
    for(int i=l;i<=r;i++) sum+=v[i]*f[i-l+1]*f[i-l+1];
    return sum;
}
int main()
{
    freopen("mirror.in","r",stdin);
    freopen("mirror.out","w",stdout);
    
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>c[i];
        w[c[i]]++;
    }
    for(int i=1;i<=n;i++) cin>>v[i];
    for(int i=1;i<=n;i++) cin>>f[i];
    for(int l=1;l<=n;l++) for(int r=l;r<=n;r++) if(pd(l,r)) ans=min(ans,q(l,r));
    cout<<ans<<endl;
    return 0;
}