#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

typedef long long ll;
typedef long double ld;

const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

int n, c;
vector<vector<tuple<int, int, int> > > g;
vector<int> res;

bool dfs(int s, int cost, int time) {
    if (cost > c) return false;
    res[s] = min(res[s], time);
    if (s == n - 1) return true;
    bool tmp = false;
    rep (i, g[s].size()) {
        int to, price, take;
        to = get<0>(g[s][i]), price = get<1>(g[s][i]), take = get<2>(g[s][i]);
        tmp |= dfs(to, cost + price, time + take);
    }
    return tmp;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int v;
    cin >> n >> c >> v;
    g.resize(n);
    res.resize(n, Inf);
    vector<int> s(v), t(v), y(v), m(v);
    rep (i, v) {
        cin >> s[i];
        s[i]--;
    }
    rep (i, v) {
        cin >> t[i];
        t[i]--;
    }
    rep (i, v) cin >> y[i];
    rep (i, v) cin >> m[i];
    rep (i, v) g[s[i]].push_back(make_tuple(t[i], y[i], m[i]));
    if (dfs(0, 0, 0)) cout << res[n - 1] << endl;
    else cout << -1 << endl;

    return 0;
}