#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 main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n, c, v;
    cin >> n >> c >> v;
    vector<vector<tuple<int, int, int> > > g(n);
    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]].emplace_back(t[i], y[i], m[i]);
    vector<vector<int> > dp(n, vector<int>(c + 1, Inf));
    dp[0][0] = 0;
    rep (i, n) {
        rep (j, g[i].size()) {
            int next = get<0>(g[i][j]);
            int cost = get<1>(g[i][j]);
            int time = get<2>(g[i][j]);
            rep (k, c) {
                if (k + cost <= c) {
                    dp[next][k + cost] = min(dp[next][k + cost], dp[i][k] + time);
                }
            }
        }
    }
    int res = Inf;
    rep (i, c + 1) res = min(res, dp[n - 1][i]);
    if (res != Inf) cout << res << endl;
    else cout << -1 << endl;

    return 0;
}