import sys
input = sys.stdin.readline


class SCC:
	def __init__(self, n):
		self.n = n
		self.route = [[] for _ in [0] * n]
		self.rev_route = [[] for _ in [0] * n]
		self.label = [-1] * n
		self.count = 0
	
	def add_edge(self, v_first, v_second):
		self.route[v_first].append(v_second)
		self.rev_route[v_second].append(v_first)

	def _build(self):
		self.v_list = []
		self.visited = set([])
		for v in range(self.n):
			if(v in self.visited):
				continue
			self._dfs(v)
		for v in reversed(self.v_list):
			if(self.label[v] != -1):
				continue
			self._rev_dfs(v)
			self.count += 1

	def _dfs(self, v_start):
		stack = [v_start, 0]
		while(stack):
			v, id = stack[-2:]
			if(id == 0 and v in self.visited):
				stack.pop()
				stack.pop()
				continue
			self.visited.add(v)
			if(id < len(self.route[v])):
				stack[-1] += 1
				stack.extend([self.route[v][id], 0])
				continue
			stack.pop()
			self.v_list.append(stack.pop())

	def _rev_dfs(self, v_start):
		stack = [v_start]
		self.label[v_start] = self.count
		while(stack):
			v_now = stack.pop()
			for v_next in self.rev_route[v_now]:
				if(self.label[v_next] != -1):
					continue
				self.label[v_next] = self.count
				stack.append(v_next)

	def construct(self):
		self._build()
		dag = [[] for _ in [0] * self.count]
		groups = [[] for _ in [0] * self.count]
		for v, lb in enumerate(self.label):
			for v_next in self.route[v]:
				lb_next = self.label[v_next]
				if(lb == lb_next):
					continue
				dag[lb].append(lb_next)
			groups[lb].append(v)
		return dag, groups


"""
Main Code
"""

N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = [x - 1 for x in map(int, input().split())]

scc = SCC(N)
for i, x in enumerate(C):
	if(i == x):
		continue
	scc.add_edge(x, i)
dag, groups = scc.construct()

n = len(groups)
a = [0] * n
b = [0] * n
for i, group in enumerate(groups):
	a[i] = sum(A[x] for x in group)
	b[i] = sum(B[x] for x in group)
rtree = [-1] * n
for x, ys in enumerate(dag):
	for y in ys:
		rtree[y] = x

def check(mid):
	dp = [x - mid * y for x, y in zip(a, b)]
	for x in range(n - 1, -1, -1):
		y = rtree[x]
		if(y == -1 and dp[x] < 0):
			return False
		dp[y] += min(dp[x], 0)
	return True

ok = 0
ng = sum(a) // sum(b) + 1
while(abs(ok - ng) > 1):
	mid = (ok + ng) >> 1
	if check(mid):
		ok = mid
	else:
		ng = mid
print(ok)