import sys
input=lambda: sys.stdin.readline().rstrip()
n=int(input())
c=int(input())
v=int(input())
S=[int(i) for i in input().split()]
T=[int(i) for i in input().split()]
Y=[int(i) for i in input().split()]
M=[int(i) for i in input().split()]
nc=n*(c+1)
edge = [[] for i in range(nc)]
for i in range(v):
  s,t,y,m=S[i],T[i],Y[i],M[i]
  for j in range(y,c+1):
    edge[s-1+j*n].append(m*10**6+t-1+(j-y)*n)

import heapq
def dijkstra_heap(s):
  d=[float("inf")]*nc
  used=[True]*nc
  d[s]=0
  used[s]=False
  edgelist=[]
  for e in edge[s]:
    heapq.heappush(edgelist,e)
  while edgelist:
    minedge=heapq.heappop(edgelist)
    minedge_cost=minedge//(10**6)
    minedge_v=minedge%(10**6)
    if not used[minedge_v]:
      continue
    d[minedge_v] = minedge_cost
    used[minedge_v] = False
    for e in edge[minedge_v]:
      e_cost=e//(10**6)
      e_v=e%(10**6)
      if used[e_v]:
        heapq.heappush(edgelist,e+minedge_cost*10**6)
  return d
D=dijkstra_heap(n*c)
ans=D[n-1]
for i in range(c):
  ans=min(ans,D[n-1+(i+1)*n])
if ans==float("inf"):
  print(-1)
else:
  print(ans)