import sys
input = sys.stdin.readline
from heapq import heappush, heappop

def dijkstra(start):
    distance = [10**18] * N
    distance[start] = 0
    priority_queue = []
    heappush(priority_queue, (distance[start], start, 0))
    
    while len(priority_queue) > 0:
        current_dist, current_node, money = heappop(priority_queue)
        
        if distance[current_node] < current_dist:
            continue
        
        for next_node, w, m in adj_list[current_node]:
            if distance[next_node] > distance[current_node] + w and money + m <= C:
                distance[next_node] = distance[current_node] + w
                heappush(priority_queue, (distance[next_node], next_node, money + m))
    
    return distance

N = int(input())
C = int(input())
V = int(input())
adj_list = [[] for _ in range(N)]
S = list(map(int, input().split()))
T = list(map(int, input().split()))
Y = list(map(int, input().split()))
M = list(map(int, input().split()))

for Si, Ti, Yi, Mi in zip(S, T, Y, M):
    adj_list[Si-1].append((Ti-1, Mi, Yi))
    
d = dijkstra(0)[N-1]

if d == 10 ** 18:
    print(-1)
else:
    print(d)