import heapq
import sys

input = sys.stdin.readline


def main():
    N = int(input())
    C = int(input())
    V = int(input())
    *S, = map(int, input().split())
    *T, = map(int, input().split())
    *Y, = map(int, input().split())
    *M, = map(int, input().split())

    adj = [[] for i in range(N)]
    for i in range(V):
        adj[S[i]-1].append((T[i]-1, Y[i], M[i]))

    vis = [[False]*N for i in range(C+1)]
    Q = [(0, C, 0)]

    while len(Q) != 0:
        d, c, v = heapq.heappop(Q)

        if vis[c][v]:
            continue
        vis[c][v] = True

        if v == N-1:
            print(d)
            return

        for u, nc, nd in adj[v]:
            if c >= nc:
                heapq.heappush(Q, (d+nd, c-nc, u))

    print(-1)


if __name__ == '__main__':
    main()