INF = 1 << 60

import heapq

n = int(input())
c = int(input())

v = int(input())
s = list(map(int, input().split()))
t = list(map(int, input().split()))
y = list(map(int, input().split()))
m = list(map(int, input().split()))

g = [[] for _ in range(n)]
for i in range(v):
  g[s[i] - 1].append((t[i] - 1, y[i], m[i]))

dist = [[INF for _ in range(c + 1)] for _ in range(n)]
dist[0][c] = 0
hp = [(0, 0, c)]
while len(hp) > 0:
  cd, cv, cc = heapq.heappop(hp)
  if cd > dist[cv][cc]:
  	continue
  for nv, cy, cm in g[cv]:
    if cc >= cy and dist[nv][cc - cy] > dist[cv][cc] + cm:
      dist[nv][cc - cy] = dist[cv][cc] + cm
      heapq.heappush(hp, (dist[nv][cc - cy], nv, cc - cy))

ans = min(dist[-1])
if ans < INF:
  print(ans)
else:
	print("-1")