N = int(input())
C = int(input())
V = int(input())
S = [[i] for i in map(lambda x:int(x) - 1, input().split())] # 行く前
T = list(map(lambda x:int(x) - 1, input().split())) # 行った後
Y = list(map(int, input().split())) # コスト
M = list(map(int, input().split())) # 時間

NUM = [0 for i in range(N + 1)]
for i in range(V):
    S[i] += [T[i], Y[i], M[i]] # 行く前 行った後 コスト 時間
    NUM[S[i][0] + 1] += 1

S.sort(key=lambda x:x[0])
for i in range(1, N + 1):
    NUM[i] += NUM[i - 1]


dp = [[float('inf') for i in range(C + 1)] for j in range(N)]
dp[0][0] = 0

for i in range(N):
    for j in range(C + 1):
        if dp[i][j] != float('inf'):
            for k in range(NUM[i], NUM[i + 1]):
                if S[k][2] + j > C:
                    continue
                dp[S[k][1]][S[k][2] + j] = min(dp[S[k][1]][S[k][2] + j], dp[i][j] + S[k][3])

ans = float('inf')
for i in dp[N - 1]:
    ans = min(ans, i)

print(ans if ans != float('inf') else -1)