#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd (i,0,n)
#define INF 1000000000

typedef long long ll;

using namespace std;

int inputValue(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision) << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

int main() {
    // source code
    int N, C, V;
    cin >> N >> C >> V;
    
    vector<int> S(V), G(V), Y(V), M(V);
    
    rep(i, V){
        cin >> S[i];
    }
    rep(i, V){
        cin >> G[i];
    }
    rep(i, V){
        cin >> Y[i];
    }
    rep(i, V){
        cin >> M[i];
    }
    
    vector<vector<pair<int, pair<int, int>>>> edge(N);
    
    rep(i, V){
        edge[S[i] - 1].push_back(make_pair(G[i] - 1, make_pair(Y[i], M[i])));
    }
    
    vector<vector<int>> dp(N, vector<int>(C + 1)); // vertex, cost
    rep(i, N){
        rep(j, C + 1){
            dp[i][j] = INF;
        }
    }
    
    dp[0][C] = 0;
    
    rep(i, N){
        rep(j, C + 1){
            if (dp[i][j] == INF || edge[i].empty()) continue;
            
            rep(k, edge[i].size()){
                if (j - edge[i][k].second.second >= 0) {
                    dp[edge[i][k].first][j - edge[i][k].second.first] = min(dp[edge[i][k].first][j - edge[i][k].second.first], dp[i][j] + edge[i][k].second.second);
                }
            }
        }
    }
    
    int ret = INF;
    rep(i, C + 1){
        ret = min(ret, dp[N - 1][i]);
    }
    
    if (ret == INF) {
        output(-1, 0);
    }
    else{
        output(ret, 0);
    }
    
    return 0;
}