#!/usr/bin/env python3
import functools
import operator


def memoize(fn):
    table = {}

    def func(*args):
        if args not in table:
            table[args] = fn(*args)
        return table[args]
    return func

N = int(input())
C = int(input())
V = int(input())
S = [int(s) for s in input().split()]
T = [int(t) for t in input().split()]
Y = [int(y) for y in input().split()]
M = [int(m) for m in input().split()]

EDGE = dict(zip(zip(S, T), zip(Y, M)))


@memoize
def path(town):
    if town == 1:
        return [[1]]
    road = [path(s) for s, t in EDGE.keys() if t == town]
    if len(road) < 1:
        return [[-1]]
    return [p + [town] for p in functools.reduce(operator.add, road)]


def cost(path):
    cost = 0
    for i in range(1, len(path)):
        if path[i - 1] < 0:
            continue
        road = EDGE[path[i - 1], path[i]]
        cost += road[0]
    return cost


def meter(path):
    meter = 0
    for i in range(1, len(path)):
        if path[i - 1] < 0:
            continue
        road = EDGE[path[i - 1], path[i]]
        meter += road[1]
    return meter


route = [meter(p) for p in path(N) if p[0] == 1 and cost(p) <= C]
if len(route) == 0:
    print(-1)
else:
    print(min(route))