def solve(N, C, V, S, T, Y, M):
    S = [s - 1 for s in S]
    T = [t - 1 for t in T]

    DP = [{} for n in range(N)]
    # DP[s][c] は、街i に残コスト c でたどり着いたときにかかった時間

    R = [[] for n in range(N)]
    for v in range(V):
        R[S[v]].append(v)

    DP[0][C] = 0

    for s in range(N):
        dpi = DP[s]
        for c in dpi:
            for v in R[s]:
                t, y, m = T[v], Y[v], M[v]
                if c < y:
                    continue
                dpt = DP[t]
                if c - y in dpt:
                    dpt[c - y] = min(dpt[c - y], dpi[c] + m)
                else:
                    dpt[c - y] = dpi[c] + m

    if len(DP[-1]) == 0:
        return -1
    return min(DP[-1].values())


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

    print(solve(N, C, V, S, T, Y, M))


if __name__ == '__main__':
    main()