#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

struct Edge {
    ll to, cost, time;
};

struct S {
    ll city, cost, time;
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll inf = LONG_LONG_MAX / 2 - 1;
    ll n, c, v;
    cin >> n >> c >> v;
    vector<vector<Edge>> g(n);
    vector<ll> 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) g[s[i] - 1].push_back((Edge){t[i] - 1, y[i], m[i]});
    vector<vector<ll>> dp(n, vector<ll>(c + 1, inf));
    dp[0][0] = 0;
    queue<S> q;
    q.push((S){0, 0, 0});
    while(!q.empty()) {
        S qv = q.front(); q.pop();
        for(auto e : g[qv.city]) {
            ll cost = qv.cost + e.cost;
            ll time = qv.time + e.time;
            if (cost > c) continue;
            if (dp[e.to][cost] <= time) continue;
            dp[e.to][cost] = time;
            q.push((S){e.to, cost, time});
        }
    }
    ll ans = inf;
    rep(i, c + 1) ans = min(ans, dp[n - 1][i]);
    if (ans == inf) {
        cout << -1 << endl;
    }
    else {
        cout << ans << endl;
    }
    return 0;
}