# coding:utf-8

def int0(n):
    return int(n)-1

N = int(input())  # 街の数
C = int(input())  # 所持金
V = int(input())  # 道の数
S = list(map(int0, input().split()))  # S->T
T = list(map(int0, input().split()))  #
Y = list(map(int, input().split()))  # cost[S][T]
M = list(map(int, input().split()))  # time[S][T]

root = [[] for i in range(N)]
for i in range(V):
    root[S[i]].append([T[i], Y[i], M[i]])
MAX = 1000 * 50 + 1
dp = [[MAX for i in range(C+1)] for j in range(N)]
dp[0][C] = 0
#  dp[ポイント][総交通費] =  総時間
for i in range(N):
    for j in range(C, 0, -1):
        if dp[i][j] == MAX:
            continue
        for kroot in root[i]:
            if kroot[1] <= j:
                dp[kroot[0]][j-kroot[1]] = min(dp[kroot[0]][j-kroot[1]], dp[i][j]+kroot[2])

ans = []
for j in range(C+1):
    if dp[N-1][j] == MAX:
        continue
    ans.append(dp[N-1][j])
if len(ans) == 0:
    print('-1')
else:
    print(min(ans))