#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    
    int N, C, V; cin >> N >> C >> V;
    vi 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];
    vector<vector<pi>> G(N, vector<pi>(N, mp(INF, INF)));
    REP(i, V)
    {
        G[S[i]][T[i]] = mp(Y[i], M[i]);
    }

    vector<vi> dp(N, vi(C+1, INF)); // 頂点nにx円持った状態の最小時間
    dp[0][C] = 0;
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> q; // t, c, n
    q.push(mt(0, C, 0));
    while(!q.empty())
    {
        tuple<int, int, int> p = q.top(); q.pop();
        int t, c, n;
        tie(t, c, n) = p;
        REP(i, N)
        {
            int y = G[n][i].first, m = G[n][i].second;
            if(c >= y && chmin(dp[i][c-y], t+m)) q.push(mt(t+m, c-y, i));
        }
    }
    int ans = INF;
    REP(i, C+1) chmin(ans, dp[N-1][i]);
    if(ans == INF) cout << -1 << endl;
    else cout << ans << endl;
}