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

MAX = 10**15
dp = [[MAX] * (C + 1) for _ in range(N + 1)]
# dp[i][j] := i番目までの街を訪れて、コストがjの時の最小時間
g = [[] for _ in range(N)]
for i in range(V):
    g[S[i] - 1].append((T[i] - 1, Y[i], M[i]))
dp[0][0] = 0
for i in range(N - 1):
    for j in range(C):
        if dp[i][j] == MAX:
            continue
        for t, y, m in g[i]:
            if j + y <= C:
                dp[t][j + y] = min(dp[t][j + y], dp[i][j] + m)
ans = min(dp[N - 1])
print(ans if ans != MAX else -1)