#include <iostream>
#include <vector>
#include <queue>

using namespace std;

#define Nmax 50
#define Vmax 1500
#define Cmax 300
#define Mmax 1000
#define Vmax 1500
#define INIDATE (Mmax*Vmax)
typedef struct S{
    int Y;
    int M;
    int T;
} ROAD;

int main() {

	int N,C,V;
    int S[Vmax];
    int T[Vmax];
    int Y[Vmax];
    int M[Vmax];
    vector<ROAD> road[Nmax+1];
    int mapdate[Nmax+1][Cmax+1];
    queue<int> quec,quen;

    cin>>N;
    cin>>C;
    cin>>V;

    for(int i=0;i<V;i++){
        cin>>S[i];
    }
    for(int i=0;i<V;i++){
        cin>>T[i];
    }
    for(int i=0;i<V;i++){
        cin>>Y[i];
    }
    for(int i=0;i<V;i++){
        cin>>M[i];
    }
    for(int i=0;i<V;i++){
        ROAD tmp;
        tmp.T=T[i];
        tmp.Y=Y[i];
        tmp.M=M[i];
        road[S[i]].push_back(tmp);
    }
    for(int i=0;i<=Nmax;i++){
        for(int j=0;j<=Cmax;j++){
            mapdate[i][j]=INIDATE;
        }
    }
    
    quen.push(1);
    quec.push(C);

    mapdate[1][C]=0;

    while(!quen.empty()){
        int n=quen.front();
        quen.pop();
        int c=quec.front();
        quec.pop();
        for(int i=0;i<road[n].size();i++){
            int nc=c-road[n][i].Y;
            int nm=mapdate[n][c]+road[n][i].M;
            if(nc>=0&&mapdate[road[n][i].T][nc]>nm){
                mapdate[road[n][i].T][nc]=nm;
                quen.push(road[n][i].T);
                quec.push(nc);
            }
        }
    }

    int ans=INIDATE;
    for(int i=0;i<=C;i++){
        if(ans>mapdate[N][i]) ans=mapdate[N][i];
    }
    if(ans==INIDATE) cout<<"-1"<<endl;
    else cout<<ans<<endl;

	return 0;
}