#include <bits/stdc++.h>
using namespace std;
inline bool isvowel(char c) {
  c = tolower(c);
  if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
    return 1;
  return 0;
}
const double eps = 0.000001;
const long double pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const long long MOD = 1e18 + 9;
const long long INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m, k;
int a[N], c[N], ans;
string s;
int u[N], p[N];
vector<int> g[N], gr[N];
void dfs(int v) {
  u[v] = 1;
  if (u[a[v]] == 1) {
    int it = v;
    int res = c[a[v]];
    while (it != a[v]) {
      res = min(res, c[it]);
      it = p[it];
    }
    ans += res;
  } else if (!u[a[v]]) {
    p[a[v]] = v;
    dfs(a[v]);
  }
  u[v] = 2;
}
int main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> c[i];
  }
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    g[i].push_back(a[i]);
  }
  for (long long i = 1; i <= n; i++) {
    if (!u[i]) dfs(i);
  }
  cout << ans;
  return 0;
}
