using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "Input4";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("3");
            WillReturn.Add("100");
            WillReturn.Add("3");
            WillReturn.Add("1 2 1");
            WillReturn.Add("2 3 3");
            WillReturn.Add("10 90 10");
            WillReturn.Add("10 10 50");
            //20
            //1→3 と行くと コスト10だが、単位時間が50掛かる。
            //1→2→3 と行くと 一文無しになるが、20単位時間なので早いのでこちらを選択する。
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("3");
            WillReturn.Add("100");
            WillReturn.Add("3");
            WillReturn.Add("1 2 1");
            WillReturn.Add("2 3 3");
            WillReturn.Add("1 100 10");
            WillReturn.Add("10 10 50");
            //50
            //1→2→3 と行くと時間は20と短いが、コスト101かかるため選択できない。
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("10");
            WillReturn.Add("10");
            WillReturn.Add("19");
            WillReturn.Add("1 1 2 4 5 1 3 4 6 4 6 4 5 7 8 2 3 4 9");
            WillReturn.Add("3 5 5 5 6 7 7 7 7 8 8 9 9 9 9 10 10 10 10");
            WillReturn.Add("8 6 8 7 6 6 9 9 7 6 9 7 7 8 7 6 6 8 6");
            WillReturn.Add("8 9 10 4 10 3 5 9 3 4 1 8 3 1 3 6 6 10 4");
            //-1
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    struct JyoutaiDef
    {
        internal int CurrPos;
        internal int SumC;
        internal int SumM;
        internal string Path;
    }

    struct MemoInfo
    {
        internal int Pos;
        internal int MinSumC;
        internal int MinSumM;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();
        int N = int.Parse(InputList[0]);
        int C = int.Parse(InputList[1]);
        int[] SArr = InputList[3].Split(' ').Select(X => int.Parse(X)).ToArray();
        int[] TArr = InputList[4].Split(' ').Select(X => int.Parse(X)).ToArray();
        int[] YArr = InputList[5].Split(' ').Select(X => int.Parse(X)).ToArray();
        int[] MArr = InputList[6].Split(' ').Select(X => int.Parse(X)).ToArray();
        int UB = SArr.GetUpperBound(0);

        var stk = new Stack<JyoutaiDef>();
        JyoutaiDef WillPush;
        WillPush.CurrPos = 1;
        WillPush.SumC = WillPush.SumM = 0;
        WillPush.Path = "1";
        stk.Push(WillPush);

        var MemoList = new List<MemoInfo>();
        MemoList.Add(new MemoInfo() { Pos = 1, MinSumC = 0, MinSumM = 0 });

        bool HasAnswer = false;
        string AnswerPath = "";
        int AnswerSumM = int.MaxValue;

        while (stk.Count > 0) {
            JyoutaiDef Popped = stk.Pop();

            //クリア処理
            if (Popped.CurrPos == N) {
                HasAnswer = true;
                if (AnswerSumM > Popped.SumM) {
                    AnswerSumM = Popped.SumM;
                    AnswerPath = Popped.Path;
                    //Console.WriteLine("解候補{0}を発見", Popped.Path);
                }
                continue;
            }

            for (int I = 0; I <= UB; I++) {
                if (Popped.CurrPos != SArr[I]) continue;
                WillPush.CurrPos = TArr[I];
                WillPush.SumC = Popped.SumC + YArr[I];
                WillPush.SumM = Popped.SumM + MArr[I];
                WillPush.Path = Popped.Path + string.Format(",{0}", TArr[I]);

                if (WillPush.SumC > C) continue;

                if (MemoList.Exists(A => A.Pos == WillPush.CurrPos
                                      && A.MinSumC <= WillPush.SumC
                                      && A.MinSumM <= WillPush.SumM))
                    continue;

                MemoInfo WillAdd;
                WillAdd.Pos = I;
                WillAdd.MinSumC = WillPush.SumC;
                WillAdd.MinSumM = WillPush.SumM;

                //無駄なメモをRemoveしてからAdd
                //MemoList.RemoveAll(A => A.Pos == I
                //                     && A.MinSumC >= WillAdd.MinSumC
                //                     && A.MinSumM >= WillAdd.MinSumM);
                MemoList.Add(WillAdd);

                stk.Push(WillPush);
            }
        }
        if (HasAnswer) {
            //Console.WriteLine(new string('■', 15));
            //Console.WriteLine("解を発見");
            Console.WriteLine(AnswerSumM);
            //Console.WriteLine("経路は{0}", AnswerPath);
        }
        else Console.WriteLine(-1);
    }
}