#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <queue>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int n,c,v;

struct edge {
    int from,to;
    int cost,time;

    edge(int t,int c) : to(t),cost(c) {}
    edge(int f,int t,int c) : from(f),to(t),cost(c) {}
    edge(int f,int t,int c,int time) : from(f),to(t),cost(c),time(time) {}
    bool operator<(const edge &e) const {
        return cost < e.cost;
    }
};

vector<edge> G[55];
int d[55],q[55];

void dijkstra(int s,int n) {
    priority_queue<P,vector<P>,greater<P> > que;
    fill(d,d+n,INF);
    memset(q,0,sizeof(q));

    d[s] = 0;
    que.push(P(0,s));

    while(que.size()) {
        P p = que.top();
        que.pop();

        int v = p.second;
        if(d[v] < p.first) continue;

        rep(i,G[v].size()) {
            edge e = G[v][i];
            if(d[e.to] >= d[v] + e.cost && q[v] + e.time <= c) {
                d[e.to] = d[v] + e.cost;
                q[e.to] = q[v] + e.time;
                que.push(P(d[e.to],e.to));
            }
        }
    }
}

int main() {
    cin >> n >> c >> v;

    vector<int> S(v),T(v),Y(v),M(v);

    rep(i,v) cin >> S[i];
    rep(i,v) cin >> T[i];
    rep(i,v) cin >> Y[i];
    rep(i,v) cin >> M[i];

    rep(i,v) {
        edge e(S[i]-1,T[i]-1,M[i],Y[i]);
        G[S[i]-1].push_back(e);
    }

    dijkstra(0,n);

    if(d[n-1] == INF) cout << -1 << endl;
    else cout << d[n-1] << endl;

    return 0;
}