from collections import deque

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()))

#print(S)
#print(T)
#print(Y)
#print(M)

p=[]
for i in range(V):
    p.append([S[i],T[i],Y[i],M[i]])

#print (p)

l=[[] for i in range(N+1)]
lw=[[] for i in range(N+1)]
lt=[[] for i in range(N+1)]
for pi in p:
    l[pi[0]].append(pi[1])
    l[pi[1]].append(pi[0])
    lw[pi[0]].append(pi[2])
    lw[pi[1]].append(pi[2])
    lt[pi[0]].append(pi[3])
    lt[pi[1]].append(pi[3])

#print(l)
#print(lw)
#print(lt)

queue=deque([1])
dp=[[-1 for i in range(C+1)] for j in range(N+1)]
dp[1][0]=0

while len(queue) > 0:
    n=queue.popleft()
    #print (n)
    f=False
    for i in range(len(l[n])):
        nt=l[n][i]
        ntw=lw[n][i]
        ntt=lt[n][i]
        #print(str(nt)+","+str(ntw)+","+str(ntt))
        for j in range(C+1):
            if dp[n][j]!=-1:
                tw=j+ntw
                tt=dp[n][j]+ntt
                #print(str(tw)+"-"+str(tt))
                if tw>C:continue
                if dp[nt][tw]==-1 or tt<dp[nt][tw]:
                    dp[nt][tw]=tt
                    f=True
        if f:queue.append(nt)
#print(dp)

ans=-1
for dpi in dp[N]:
    if(dpi!=-1):
        if(ans==-1):
            ans=dpi
        else:
            ans=min(ans,dpi)

print (str(ans))