n, c, v, *L = map(int, open(0).read().split())
g = [[] for _ in range(n)]
for s, t, y, m in zip(L, L[v:], L[2 * v:], L[3 * v:]):
	g[s - 1].append((t - 1, y, m))

dp = [[1 << 30] * (c + 1) for _ in range(n)]
dp[0][c] = 0
q = [0]
while q:
	cur = q.pop(0)
	for nxt, y, m in g[cur]:
		for i in range(y, c + 1):
			if dp[nxt][i - y] > dp[cur][i] + m:
				dp[nxt][i - y] = dp[cur][i] + m
		q.append(nxt)
ans = min(dp[-1])
print(ans if ans != 1 << 30 else -1)