#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n, C, v;
        cin >> n >> C >> v;

        vector<int> s(v), t(v), y(v), m(v);
        for (int i = 0; i < v; i++) {
            cin >> s[i];
            s[i]--;
        }
        for (int i = 0; i < v; i++) {
            cin >> t[i];
            t[i]--;
        }
        for (int i = 0; i < v; i++) {
            cin >> y[i];
        }
        for (int i = 0; i < v; i++) {
            cin >> m[i];
        }

        vector<vector<array<int, 3>>> adj(n);
        for (int i = 0; i < v; i++) {
            adj[s[i]].push_back({t[i], y[i], m[i]});
        }

        vector dis(n, vector<int>(C + 1, -1));
        priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> h;
        h.push({0, 0, 0});

        while (!h.empty()) {
            auto [d, u, i] = h.top();
            h.pop();

            if (dis[u][i] != -1) {
                continue;
            }
            
            dis[u][i] = d;

            for (auto [v, y, m] : adj[u]) {
                if (i + y <= C) {
                    h.push({d + m, v, i + y});
                }
            }
        }

        int ans = -1;

        for (int i = 0; i <= C; i++) {
            if (ans == -1 || dis[n - 1][i] != -1 && dis[n - 1][i] < ans) {
                ans = dis[n - 1][i];
            }
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}