#include <bits/stdc++.h>
#include <atcoder/dsu>
#include <atcoder/scc>
using namespace std;
template <class F> class y_combinator {
	F f;

  public:
	y_combinator(F&& f) : f(std::forward<F>(f)) {}
	template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back

void run_case() {
	int N;
	cin >> N;
	vector<ll> A(N), B(N), C(N);
	ll sum = 0;
	rep(i, N) cin >> A[i], sum += A[i];
	rep(i, N) cin >> B[i];
	atcoder::scc_graph G(N);
	atcoder::dsu uf(N);
	rep(i, N) {
		cin >> C[i], C[i]--;
		G.add_edge(C[i], i);
		uf.merge(C[i], i);
	}
	const auto scc = G.scc();
	auto check = [&](ll K) -> bool {
		rep(i, N) {
			if(!(B[i] <= sum/K)) return false;
		}
		vector<ll> R(N);
		auto U = A;
		for(auto gs: scc) {
			for(int v: gs) {
				if(B[v] <= U[v] / K) {
					ll r = U[v] - B[v] * K;
					R[uf.leader(v)] += r;
					U[v] -= r;
				} else {
					ll need = B[v] * K - U[v];
					ll t = min(R[uf.leader(v)], need);
					U[v] += t;
					R[uf.leader(v)] -= t;
				}
			}
			for(int v: gs) {
				if(B[v] <= U[v] / K) {
					ll r = max(0LL,U[v] - B[v] * K);
					R[uf.leader(v)] += r;
					U[v] -= r;
				} else {
					ll need = B[v] * K - U[v];
					ll t = min(R[uf.leader(v)], need);
					U[v] += t;
					R[uf.leader(v)] -= t;
				}
				if(U[v] != B[v] * K) {
					return false;
				}
			}
		}
		return true;
	};
	ll ok = 0, ng = 1e15;
	while(ng - ok > 1) {
		ll mi = (ok + ng) / 2;
		(check(mi) ? ok : ng) = mi;
	}
	cout << ok << endl;
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::fixed(std::cout).precision(16);
	int T = 1;
	//cin >> T;
	while(T--) run_case();
	return 0;
}