#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 vl  = 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 N, C, V; 
vector<vector<tuple<int, int, int>>> G;
vector<bool> visited;
vector<int> sorted;
int sp = 0;

void dfs(int n)
{
    visited[n] = true;
    for(auto e : G[n])
    {
        int to, y, m;
        tie(to, y, m) = e;
        if(!visited[to]) dfs(to);
    }
    sorted[sp++] = n;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    
    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];
    G.resize(N);
    REP(i, V)
    {
        G[S[i]].pb(mt(T[i], Y[i], M[i]));
    }

    visited.resize(N, false);
    sorted.resize(N);
    dfs(0);
    reverse(ALL(sorted));

    vector<vi> dp(N, vi(C+1, INF));
    dp[0][C] = 0;

    REP(i, N)
    {
        int from = sorted[i]; 
        for(auto e : G[from])
        {
            int to, y, m;
            tie(to, y, m) = e;
            REP(c, C+1)
            {
                if (c >= y) chmin(dp[to][c-y], dp[from][c] + m);
            }
        }
    }

    int ans = INF;
    chmin(ans, *min_element(ALL(dp[N-1])));
    cout << ((ans != INF) ? ans : -1) << endl;
}