#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 9;

typedef pair<int, pair<int, int> > P; // dist, (v, money)
struct edge { int to, cost, dist; };

int N, C, V;
vector<edge> G[50];
int S[1500], T[1500], Y[1500], M[1500];

int dp[50][301]; // vertex, money => dist

int main() {
    cin >> N >> C >> V;
    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) {
        S[i]--; T[i]--;
        G[S[i]].push_back((edge){T[i], Y[i], M[i]});
    }

    rep (i, 50) rep (j, 301) dp[i][j] = inf;
    dp[0][0] = 0;
    priority_queue<P, vector<P>, greater<P> > q;
    q.emplace(0, make_pair(0, 0));

    while (!q.empty()) {
        P p = q.top(); q.pop();
        int dist = p.first;
        int curr = p.second.first;
        int money = p.second.second;

        if (dist > dp[curr][money]) continue;

        for (edge e : G[curr]) {
            if (money + e.cost > C) continue;
            if (dp[e.to][money + e.cost] > dp[curr][money] + e.dist) {
                dp[e.to][money + e.cost] = dp[curr][money] + e.dist;
                q.emplace(dp[e.to][money + e.cost], make_pair(e.to, money + e.cost));
            }
        }
    }

    int ans = inf;
    rep (j, C + 1) {
        ans = min(ans, dp[N - 1][j]);
    }

    if (ans == inf) ans = -1;
    cout << ans << endl;
}