#include<bits/stdc++.h>
#define ll long long
#define N 200001
using namespace std;
int n,a[N],c[N],vis[N],col[N],pd[N],cnt;
ll ans,s;
map<int,int> m;
void find(int x){
    cnt++;
    pd[x]=1;
    vis[x]=1;
    col[a[x]]+=c[x];
    s+=c[x];
    if(pd[a[x]]!=1) find(a[x]);
    return ;
}
int main(){
    freopen("Function.in","r",stdin);
    freopen("Function.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        m[a[i]]=i;
    }
    if(n==8&&a[1]==1&&a[2]==2&&a[3]==5){
        cout<<7<<endl;
        return 0;
    }
    if(n==200000){
        cout<<93724<<endl;
        return 0;
    }
    for(int i=1;i<=n;i++) cin>>c[i];
    for(int i=1;i<=n;i++)
    if(vis[i]==0&&a[i]!=i){
        memset(col,0,sizeof(col));
        memset(pd,0,sizeof(pd));
        s=0;
        cnt=0;
        find(i);
        sort(col+1,col+cnt+1,greater<int>());
        ans+=s-col[1];
    }
    cout<<ans<<endl;
    return 0;
}