n = int(raw_input())
c = int(raw_input())
v = int(raw_input())
s = map(int, raw_input().split())
t = map(int, raw_input().split())
y = map(int, raw_input().split())
m = map(int, raw_input().split())

a = [[c,0,0]]
b = [[] for _ in range(n-1)]
d = [[] for _ in range(n-1)]
for i in range(v):
	b[s[i]-1].append([y[i],m[i],t[i]-1])
ans = []
while a:
	ac,at,ap = a.pop()
	for bi in b[ap]:
		bc,bt,bp = bi
		if ac >= bc:
			if bp == n-1:
				ans.append([ac-bc,at+bt])
			else:
				for dc,dt in d[bp]:
					if ac-bc >= dc and at+bt >= dt: break
				else:
					d[bp].append([ac-bc,at+bt])
					a.append([ac-bc,at+bt,bp])

print sorted(ans,key=lambda x:x[1])[0][1] if ans else -1