N = int(raw_input())
C = int(raw_input())
V = int(raw_input())
S = map(int, raw_input().split())
T = map(int, raw_input().split())
Y = map(int, raw_input().split())
M = map(int, raw_input().split())
road = []
for i in range(0, V):
	road.append([S[i]-1, T[i]-1, Y[i], M[i]])
road.sort(key=lambda val: val[0])
dp = []
for i in range(0, V+1):
	lst = []
	for j in range(0, N):
		lst.append([])
	dp.append(lst)
dp[0][0].append([0, C])
for i in range(0, V):
	for j in range(0, N):
		for k in range(0, len(dp[i][j])):
			dp[i+1][j].append(dp[i][j][k])
	for j in range(0, N):
		if j == road[i][0]:
			next = road[i][1]
			for k in range(0, len(dp[i][j])):
				newtime = dp[i][j][k][0] + road[i][3]
				newcost = dp[i][j][k][1] - road[i][2]
				flag = True
				for p in range(0, len(dp[i+1][next])):
					time = dp[i+1][next][p][0]
					cost = dp[i+1][next][p][1]
					if time < newtime and newcost < cost:
						flag = False
						break
				if flag: dp[i+1][next].append([newtime, newcost])
if dp[V][N-1] == []: print -1
else:
	min = 1000000000
	for i in range(0, len(dp[V][N-1])):
		if dp[V][N-1][i][0] < min and dp[V][N-1][i][1] >= 0: min = dp[V][N-1][i][0]
	if min == 1000000000: print -1
	else: print min