#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));
    dp[0][C] = 0;
    queue<pi> q;
    q.push(mp(0, C));
    while(!q.empty())
    {
        pi p = q.front(); q.pop();
        int n, c;
        tie(n, c) = p;
        REP(i, N)
        {
            pi e = G[n][i];
            if(e != mp(INF, INF) && c >= e.first && chmin(dp[i][c-e.first], dp[n][c]+e.second)) q.push(mp(i, c-e.first));
        }
    }

    int ans = INF;
    REP(c, C+1) chmin(ans, dp[N-1][c]);
    cout << ((ans != INF) ? ans : -1) << endl;
}