#!/usr/bin/env python3

import array
import collections
import itertools


IMPOSSIBLE = -1
INF = 10 ** 8
Edge = collections.namedtuple("Edge", "start end money time")
AdjVertex = collections.namedtuple("AdjVertex", "dest, money, time")
State = collections.namedtuple("State", "time money vertex")


def compute_min_time(num_vertices, money_limit, adj_vertices):
    dp = [array.array("L", (INF for _ in range(money_limit + 1)))
          for _ in range(num_vertices)]
    dp[0][0] = 0
    for v, m in itertools.product(range(num_vertices), range(money_limit + 1)):
        for adj in adj_vertices[v]:
            new_money = m + adj.money
            if new_money <= money_limit:
                dp[adj.dest][new_money] = min(dp[adj.dest][new_money],
                                              dp[v][m] + adj.time)
    answer = min(dp[num_vertices - 1])
    return answer if answer < INF else IMPOSSIBLE


def main():
    num_vertices = int(input())
    money_limit = int(input())
    _ = input()
    ss = map(lambda x: int(x) - 1, input().split())
    ts = map(lambda x: int(x) - 1, input().split())
    ys = map(int, input().split())
    ms = map(int, input().split())
    adj_vertices = [set() for _ in range(num_vertices)]
    for edge in (Edge(*args) for args in zip(ss, ts, ys, ms)):
        adj_vertices[edge.start].add(AdjVertex(*edge[1:]))
    answer = compute_min_time(num_vertices, money_limit, adj_vertices)
    print(answer)


if __name__ == '__main__':
    main()