N = int(input())
C = int(input())
V = int(input())
S = list(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()))
INF = 10**10
edge = [[] for _ in range(N)]
for s, t, y, m in zip(S, T, Y, M):
    edge[s].append([t, y, m])
dp = [[INF]*(C+10) for _ in range(N+10)]
dp[0][0] = 0

for i in range(N-1):
    for t, y, m in edge[i]:
        for j in range(C+1):
            if j+y > C:
                break
            dp[t][j+y] = min(dp[t][j+y], dp[i][j]+m)

if min(dp[N-1])==INF:
    print(-1)
    print(min(dp[N-1]))