#!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9

n = int(input())
c = int(input())
v = int(input())
ss = [int(item) for item in input().split()]
ts = [int(item) for item in input().split()]
ys = [int(item) for item in input().split()]
ms = [int(item) for item in input().split()]
edge = []
for s, t, y, m in zip(ss, ts, ys, ms):
    s -= 1; t -= 1
    edge.append((s, t, y, m))
edge.sort()

dp = [[INF] * (c + 1) for _ in range(n)]
dp[0][c] = 0

for s, t, y, m in edge:
    for i in range(y, c + 1):
        if dp[s][i] == INF:
            continue
        dp[t][i - y] = min(dp[t][i - y], dp[s][i] + m)
ans = min(dp[-1])
if ans == INF:
    print(-1)
else:
    print(ans)