#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    int n, c, m;
    cin >> n >> c >> m;
    vi s(m), t(m), x(m), y(m);
    rep(i, m) cin >> s[i], --s[i];
    rep(i, m) cin >> t[i], --t[i];
    rep(i, m) cin >> x[i];
    rep(i, m) cin >> y[i];
    using T = tuple<int, int, int>;
    vector<vector<T>> es(n);
    rep(i, m) es[s[i]].emplace_back(t[i], x[i], y[i]);
    const ll inf = 1e18;
    vector dp(n, vl(c + 1, inf));
    dp[0][c] = 0;
    rep(i, n) rep(j, c + 1) {
        for (auto&& [to, cost, time] : es[i]) {
            if (j < cost) continue;
            chmin(dp[to][j - cost], dp[i][j] + time);
        }
    }
    ll ans = *min_element(all(dp.back()));
    if (ans == inf) ans = -1;
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // multi-testcase
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}