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

from heapq import heapify,heappop,heappush
que=[]
se=set()
from collections import defaultdict
edge=defaultdict(list)

s=list(map(lambda x:int(x)-1,input().split()))
t=list(map(lambda x:int(x)-1,input().split()))
y=list(map(int,input().split()))
m=list(map(int,input().split()))
for i in range(v):
    si,ti,yi,mi=s[i],t[i],y[i],m[i]
    edge[si].append((ti,yi,mi))

heappush(que,(0,0,0))
INF=float('inf')
mi_y=[INF]*n
mi_y[0]=0
ans=INF

while que:
    ci,cm,cy=heappop(que)
    if ci==n-1:
        ans=min(cm,ans)

    for ni,ny,nm in edge[ci]:
        sm=cm+nm
        sy=cy+ny
        if sy>c:
            continue
        if mi_y[ni]<sy:
            continue
        heappush(que,(ni,sm,sy))
print(ans if ans!=INF else -1)