def one_str():
    return input()

def many_int():
    return list(map(int, input().split()))

import heapq

input_count = 0
N = int(input())
C = int(input())
V = int(input())

S = many_int()
T = many_int()
Y = many_int()
M = many_int()

G = {i:[] for i in range(N)}
temp_G = {i:set([]) for i in range(N)}

for i in range(V):
    temp_G[S[i]-1].add(f"{T[i]-1}_{M[i]}_{Y[i]}")
    
for k, v in temp_G.items():
    
    for vv in v:
        t,m,y = vv.split("_")
        G[k].append((int(t), int(m), int(y)))

G

q = [[0,0,0]]

mins = 10**10
while q:
    all_minute, all_cost, now_node = heapq.heappop(q)
    if now_node == (N-1):
        mins = min(mins, all_minute)
        break
        continue
    
    for next_node, next_minute, next_cost in G[now_node]:
        if (all_cost + next_cost) > C:
            continue
        else:
            heapq.heappush(q, (all_minute+next_minute, all_cost+next_cost, next_node))
            

if mins == 10**10:
    print(-1)
else:
    print(mins)