#include<iostream>
#include<vector>
#include<cassert>
using namespace std;
int N,A[1<<17],B[1<<17],C[1<<17];
long need[1<<17];
int deg[1<<17];
bool vis[1<<17];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	for(int i=0;i<N;i++)cin>>B[i];
	for(int i=0;i<N;i++)
	{
		cin>>C[i],C[i]--;
		deg[C[i]]++;
	}
	vector<int>Q;
	for(int i=0;i<N;i++)if(!deg[i])Q.push_back(i);
	for(int i=0;i<Q.size();i++)
	{
		int u=Q[i];
		vis[u]=true;
		if(!--deg[C[u]])Q.push_back(C[u]);
	}
	vector<vector<int> >Lp;
	for(int i=0;i<N;i++)if(!vis[i])
	{
		int u=i;
		Lp.push_back(vector<int>());
		while(!vis[u])
		{
			Lp.back().push_back(u);
			vis[u]=true;
			u=C[u];
		}
	}
	long L=0,R=1e15;
	while(R-L>1)
	{
		long k=(L+R)/2;
		bool out=false;
		for(int i=0;i<N;i++)
		{
			if(B[i]>(long)1e15/k)
			{
				out=true;
				break;
			}
			need[i]=k*B[i];
		}
		if(out)
		{
			R=k;
			continue;
		}
		for(int u:Q)
		{
			need[C[u]]+=max(need[u]-A[u],0L);
			if(need[C[u]]>(long)1e15)out=true;
		}
		for(int i=0;i<Lp.size();i++)
		{
			long sN=0,sA=0;
			for(int u:Lp[i])
			{
				sN+=need[u];
				sA+=A[u];
				if(sN>(long)1e15)break;
			}
			if(sN>sA)
			{
				out=true;
				break;
			}
		}
		if(out)R=k;
		else L=k;
	}
	cout<<L<<endl;
}