#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    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<tuple<int, int, int>>> graph(N);
    for (int i = 0; i < V; i++) {
        graph[S[i]].emplace_back(T[i], Y[i], M[i]);
    }
    
    const int INF = 1e9;
    vector<vector<int>> dp(N, vector<int>(C + 1, INF));
    dp[0][C] = 0;
    
    for (int i = 0; i < N; i++) {
        for (int k = C; k >= 0; k--) {
            if (dp[i][k] == INF) continue;
            for (auto [to, cost, time] : graph[i]) {
                if (k >= cost) {
                    dp[to][k - cost] = min(dp[to][k - cost], dp[i][k] + time);
                }
            }
        }
    }
    
    int result = *min_element(dp[N-1].begin(), dp[N-1].end());
    cout << (result == INF ? -1 : result) << endl;
    
    return 0;
}