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

town = [[(None, None)] for i in range(N)]
town[0] = [(0, 0)]
for i in range(N):
    for v in range(V):
        if S[v]-1 == i:
            for t in town[i]:
                if t[0] is None: continue
                cost = t[0] + Y[v]
                if cost > C: continue
                time = t[1] + M[v]
                if town[T[v]-1][0] == (None, None):
                    town[T[v]-1][0] = (cost, time)
                else:
                    for t1 in town[T[v]-1]:
                        if cost > t1[0] and time > t1[1]:
                            break
                    else:
                        town[T[v]-1].append((cost, time))

ans = 1000 * N
if town[N-1][0] == (None, None):
    ans = -1
else:
    for t in town[N-1]:
        if ans > t[1]: ans = t[1]

print(ans)