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

f_inf = float('inf')
dp = [[f_inf] * (c + 1) for _ in range(n + 1)]

dp[1][c] = 0
for i in range(1, n + 1):
    for j in range(c, -1, -1):
        if dp[i][j] != f_inf:
            for k in range(v):
                if i == s[k] and j - y[k] >= 0:
                    dp[t[k]][j - y[k]] = min(dp[i][j] + m[k], dp[t[k]][j - y[k]])

ans = f_inf
for i in range(c + 1):
    ans = min(ans, dp[n][i])

if ans >= f_inf:
    print(-1)
else:
    print(ans)