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

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

g = [[] for _ in range(n)]

for i in range(v):
    s[i] -= 1
    t[i] -= 1
    g[s[i]].append((m[i], y[i], t[i])) # 時間・コスト・行き先
#print('g:のグラフ')
#print(*g, sep='\n')

INF = 10 ** 18
dist = [INF] * n # かかる時間
cost = [INF] * n # 必要なコスト
dist[0] = 0
cost[0] = 0
q = [(0, 0, 0)] # 時間・コスト・今いる場所
heapify(q)

while q:
    pre_time, pre_cost, pre_ind = heappop(q)
    for nxt_time, nxt_cost, nxt_ind in g[pre_ind]:
        if dist[nxt_ind] <= dist[pre_ind] + nxt_time: continue
        if cost[pre_ind] + nxt_cost > c: continue
        dist[nxt_ind] = dist[pre_ind] + nxt_time
        cost[nxt_ind] = cost[pre_ind] + nxt_cost
        heappush(q, (dist[nxt_ind], cost[nxt_ind], nxt_ind))
        #print(dist)
        #print(cost)
        #print(q)
        #print()

##print(dist)
#print(cost)
print(dist[-1]) if dist[-1] != INF else print(-1)