#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <functional>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define REP(i,n) for (int i = 0; i < (n); i++)
#define REPS(i,n) for (int i = 0; i <= (n); i++)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define FORS(i,s,n) for (int i = (s); i <= (n); i++)
#define INF (1L << 30)
#define LINF (1LL << 6

int S[1500], T[1500];
int edge[51][51], cost[51][51], dist[51][51];
int Y[1500], M[1500];
int dp[51][301];

int main() {
    int n,c,v;
    cin >> n >> c >> v;
    REP(i, v) cin >> S[i];
    REP(i, v) cin >> T[i];
    REP(i, v) cin >> Y[i];
    REP(i, v) cin >> M[i];
    
    fill((int*)edge, (int*)edge+51*51, 0);
    REP(i, v) {
        edge[S[i]][T[i]] = 1;
        cost[S[i]][T[i]] = Y[i];
        dist[S[i]][T[i]] = M[i];
    }
    
    
    fill((int*)dp, (int*)dp+51*301, INF);
    dp[1][0] = 0;
    FORS(i, 1, n) FORS(j, i+1, n) REPS(k, c) {
        if(dp[i][k] != INF && edge[i][j] == 1 && cost[i][j]+k <= 300)
            dp[j][cost[i][j]+k] = min(dp[j][cost[i][j]+k], dp[i][k] + dist[i][j]);
    }
    int ans = INF;
    REP(i, c+1) ans = min(ans, dp[n][i]);
    cout << (ans==INF ? -1 : ans) << endl;
    
    return 0;
}