#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

struct Edge {
    int to,cost, time;
};

int main() {
    int n, c, v;
    cin >> n >> c >> v;
    vector<vector<Edge>> G(n);
    vector<int> s(v),t(v),y(v),m(v);
    // dp[i][j]:頂点1から頂点iにコストjで行けるときの最小の時間
    vector<vector<ll>> dp(n,vector<ll>(c+1,LLINF));
    REP(i,c) dp[0][i] = 0;
    REP(i, v) cin >> s[i];
    REP(i, v) cin >> t[i];
    REP(i, v) cin >> y[i];
    REP(i, v) cin >> m[i];
    REP(i, v) {
        G[s[i] - 1].push_back({t[i] - 1,y[i],m[i]});
    }
    queue<int> que;
    que.push(0);
    while (!que.empty()) {
        int q = que.front(); que.pop();
        for (Edge e : G[q]) {
            REP(i, c - e.cost + 1) {
                if (dp[q][i] != LLINF) {
                    dp[e.to][e.cost + i] = min(dp[e.to][e.cost + i], dp[q][i] + e.time);
                }
            }
            que.push(e.to);
        }
    }
    ll ans = LLINF;
    REP(i, c + 1) {
        if (dp[n - 1][i] != LLINF) {
            ans = min(ans, dp[n - 1][i]);
        }
    }
    if (ans == LLINF) ans = -1;
    cout << ans << endl;
    getchar(); getchar();
}