#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct node {
    int at;
    int cost; 
    int money;
    node(int at, int cost, int money) : at(at), cost(cost), money(money) {}
    bool operator>(const node &s) const {
        if (cost != s.cost) return cost > s.cost;
        if (money != s.money) return money > s.money;
        return at > s.at;
    }
};

struct Edge {
  int to;
  int t_cost;
  int m_cost;
  Edge(int to, int t_cost, int m_cost) : to(to), t_cost(t_cost), m_cost(m_cost) {}  
};

typedef vector<vector<Edge> > AdjList; //隣接リスト
typedef vector<Edge>::iterator Edge_it;

const int INF = 10000000;

AdjList graph;
vector<int> minc; //最短経路のコスト

void dijkstra(int n, int s, int c){ 
    minc = vector<int>(n, INF);
    priority_queue<node, vector<node>, greater<node> > pq;
    pq.push(node(s, 0, 0));
    while(!pq.empty()) {
        node x = pq.top();
        pq.pop();
        minc[x.at] = min(x.cost, minc[x.at]);
        for(Edge_it i = graph[x.at].begin(), e = graph[x.at].end(); i != e; ++i) {
            if (x.money + (*i).m_cost > c) continue;
            pq.push(node((*i).to, x.cost + (*i).t_cost, x.money + (*i).m_cost));
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, v, c, s[1500], t[1500], y[1500], m[1500];
    cin >> n >> c >> v;
    graph = AdjList(n);
    for(int i = 0; i < v; i++) {
        cin >> s[i];
        s[i]--;
    }
    for(int i = 0; i < v; i++) {
        cin >> t[i];
        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++) {
        graph[s[i]].push_back(Edge(t[i], m[i], y[i]));
    }
    dijkstra(n, 0, c);
    if (minc[n - 1] == INF) cout << -1 << "\n";
    else cout << minc[n - 1] << "\n";
    return 0;
    }