# coding:utf-8
import sys


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]

# cost = [[[C*N+1] for a in range(N)] for b in range(N)]
# time = [[[1000*N+1] for c in range(N)] for d in range(N)]

# cost = [[[] for a in range(N)] for b in range(N)]
# # time = [[[] for c in range(N)] for d in range(N)]
#
# for i in range(N):
#     cost[i][i].append([0])
#     # time[i][i].append(0)
#
# root = []
# cost_and_time = [[] for i in range(N)]
# for i in range(V):
#     # cost[S[i]][T[i]].append([Y[i], M[i]])
#     # time[S[i]][T[i]].append(M[i])
#     root[S[i]].appned(T[i])
# cost_and_time = cost[S[i]][T[i]].append([Y[i], M[i]])
# next_root = root[0]
# p = 0
# while not next_root:
#     for i in root[0]:
#         for cost in cost[p][i]:

root = [[] for i in range(N)]
for i in range(V):
    root[S[i]].append([T[i], Y[i], M[i]])
MAX = 9999999
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))


# for k in range(N):
#     for i in range(N):
#         for j in range(N):
#             cost[i][j] = min(cost[i][j], cost[i][k]+cost[k][j])
#
# if cost[0][N-1]>C:
#     print('-1')
#     sys.exit(0)
#
# for k in range(N):
#     for i in range(N):
#         for j in range(N):
#             # if cost[i][k]+cost[k][j]<=C:
#             time[i][j] = min(time[i][j], time[i][k]+time[k][j])

# print(cost[0])
# print(time[0])
# print(time[0][N-1])