#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
	ll N;cin>>N;
	vl A(N),B(N),C(N);cin>>A>>B>>C;
	rep(i,0,N)C[i]--;
	vl X=C;
	rep(_,0,20){
		vl _X(N);
		rep(i,0,N)_X[i]=X[X[i]];
		X=_X;
	}
	vb cyc(N);
	rep(i,0,N)cyc[X[i]]=1;
	vb alive(N,1);
	vl F;
	rep(i,0,N)if(cyc[i]){
		ll v=i,s=0,t=0;
		do{
			s+=B[v];
			t+=A[v];
			B[v]=A[v]=0;
			alive[v]=0;
			v=C[v];
			cyc[v]=0;
		}while(v!=i);
		A[i]=t;
		B[i]=s;
		C[i]=i;
		F.emplace_back(i);
	}
	vvl E(N);
	rep(i,0,N)if(alive[i])E[C[i]].emplace_back(i);
	ll l=0,r=1e18;
	while(r-l>1){
		ll m=(l+r)/2;
		queue<ll>Q;
		for(auto i:F)Q.emplace(i);
		bool ok=1;
		vector<__int128>X(N);
		rep(i,0,N)X[i]=A[i];
		for(auto r:F){
			function<void(ll)>dfs=[&](ll v){
				for(auto u:E[v])dfs(u);
				X[v]-=(__int128)m*B[v];
				if(v==r)return;
				if(X[v]>=0)return;
				X[C[v]]+=X[v];
				
			};
			dfs(r);
			if(X[r]<0)ok=0;
		}
		if(ok)l=m;
		else r=m;
	}
	cout<<l<<endl;
	return 0;
}