#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0;
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void _put(T x)
{
	if (x < 0)
		x = -x, putchar('-');
	put(x);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}
template <class T>
inline void CkMax(T &x, T y) {x < y ? x = y : 0;}
template <class T>
inline T Min(T x, T y) {return x < y ? x : y;}
template <class T>
inline T Max(T x, T y) {return x > y ? x : y;}
template <class T>
inline T Abs(T x) {return x < 0 ? -x : x;}
template <class T>
inline T Sqr(T x) {return x * x;}
// 若传入 int x 同时结果可能爆 int 应这样写 Sqr((ll)x)

using std::map;
using std::set;
using std::pair;
using std::bitset;
using std::string;
using std::vector;
using std::complex;
using std::multiset;
using std::priority_queue;

typedef long long ll;
typedef long double ld;
typedef complex<ld> com;
typedef pair<int, int> pir;
const ld pi = acos(-1.0);
const ld eps = 1e-8;
const int N = 1e5 + 5;
const ll Maxn = 1e18;
const int Minn = -1e9;
const int mod = 998244353;
int T_data, n, cm;
int p[N], cur[N], a[N], b[N];
bool vis[N];
ll ans, f[N][2][2];

inline void dfs(int x)
{
	vis[x] = true;
	cur[cm = 1] = x;
	if (x == p[x])
		return ;
	while (!vis[p[x]])
	{
		vis[cur[++cm] = p[x]] = true;
		x = p[x];
	}
	for (int i = 1; i <= cm; ++i)
		for (int j = 0; j < 2; ++j)
			for (int k = 0; k < 2; ++k)
				f[i][j][k] = Maxn;
	std::reverse(cur + 1, cur + cm + 1);
	f[1][0][0] = a[cur[1]];
	f[1][0][1] = a[cur[1]] + b[cur[1]];
	f[1][1][1] = b[cur[1]];
	for (int i = 1; i < cm; ++i)
		for (int j = 0; j < 2; ++j)
		{
			if (f[i][j][0] != Maxn)
			{
				CkMin(f[i + 1][j][0], f[i][j][0] + a[cur[i + 1]]);
				CkMin(f[i + 1][j][1], f[i][j][0] + a[cur[i + 1]] + b[cur[i + 1]]);
			}
			if (f[i][j][1] != Maxn)
			{
				CkMin(f[i + 1][j][1], f[i][j][1] + b[cur[i + 1]]);
				CkMin(f[i + 1][j][0], f[i][j][1] + a[cur[i + 1]]);
			}
		}
	ans += Min(Min(f[cm][0][1], f[cm][1][1]), f[cm][0][0]); 
}

int main()
{
	read(n);
	for (int i = 1; i <= n; ++i)
		read(p[i]);
	for (int i = 1; i <= n; ++i)
		read(a[i]);
	for (int i = 1; i <= n; ++i)
		read(b[i]);
	for (int i = 1; i <= n; ++i)
		if (!vis[i])
			dfs(i);
	std::cout << ans << std::endl;
	return 0;
}