#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")

#define int long long
#define pb push_back
#define all(s) s.begin(),s.end()
#define pii pair<int,int>
#define fr first
#define sc second
#define bst ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define no cout << "NO" << endl;
#define yes cout << "YES" << endl;

using namespace std;

const int N = 5e5 + 10, mod = 1e9 + 7, inf = 1e18 + 7, logn = 23;
const double pi = acos(-1);

int up[32][N], c[N], s[N];
int n;
void build() {
	for(int i = 1; i <= 30; i++) {
		for(int j = 1; j <= n; j++) {
			up[i][j] = up[i - 1][up[i - 1][j]];
		}
	}
}

void solve() {
	freopen("F.in", "r", stdin);
	freopen("F.out", "w", stdout);

	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> up[0][i];
	}
	for(int i = 1; i <= n; i++) {
		cin >> c[i];
	}

	build();
	int ans = 0;
	for(int i = 1; i <= n; i++) {
		s[up[30][i]] += c[i];
	}
	for(int i = 1; i <= n; i++) {
		ans = max(ans, s[i]);
	}
	cout << ans << endl;
}
main() {
	bst;
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}