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

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    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<vector<int>>> graph(N);
    for (int i = 0; i < V; i++) {
        graph[S[i]].push_back({T[i], Y[i], M[i]});
    }
    
    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& edge : graph[i]) {
                int t = edge[0], c = edge[1], tm = edge[2];
                if (k >= c) {
                    dp[t][k - c] = min(dp[t][k - c], dp[i][k] + tm);
                }
            }
        }
    }
    
    int result = *min_element(dp[N - 1].begin(), dp[N - 1].end());
    cout << (result == INF ? -1 : result) << endl;
    
    return 0;
}