#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using tp = tuple<int, int, int>;

int s[1501], t[1501], y[1501], m[1501];

// vector<pii> adj;
vector<tp> adj[51];
int indeg[51];
int mincost[51], mintime[51];

int main() {
    #ifdef DEBUG
        freopen("in.txt", "r", stdin);
    #endif
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n, c, v; cin >> n >> c >> v;
    for (int i = 0; i < v; i++) cin >> s[i];
    for (int i = 0; i < v; i++) cin >> t[i];
    for (int i = 0; i < v; i++) cin >> y[i];
    for (int i = 0; i < v; i++) cin >> m[i];

    memset(mincost, 0x3f, sizeof(mincost));
    memset(mintime, 0x3f, sizeof(mintime));

    for (int i = 0; i < v; i++) {
        adj[s[i]].emplace_back(t[i], y[i], m[i]);  // start, end, cost, time
        indeg[t[i]]++;
    }

    assert(indeg[1] == 0);
    mincost[1] = mintime[1] = 0;

    queue<int> q;
    for (int i = 1; i <= n; i++) {
        if (!indeg[i]) {
            q.push(i);
        }
    }

    while (!q.empty()) {
        int x = q.front(); q.pop();

        for (auto [nx, ncost, ntime] : adj[x]) {
            if (mintime[nx] >= mintime[x] + ntime) {
                // check if cost overs c
                if (mincost[x] + ncost > c) {
                    continue;
                }
                mintime[nx] = mintime[x] + ntime;
                mincost[nx] = mincost[x] + ncost;
            }
            indeg[nx]--;
            if (!indeg[nx]) q.push(nx);
        }
    }

    cout << (mintime[n] == 0x3f3f3f3f ? -1 : mintime[n]) << '\n';

    return 0;
}