#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 1510;

struct edge{
    int to, cost, time;
    edge(int to, int c, int t): to(to), cost(c), time(t){}
};

int n, C, m, S[MAX], T[MAX], Y[MAX], M[MAX], d[55][310];
vector<edge> G[55];

int main(){
    scanf("%d%d%d", &n, &C, &m);
    rep(i, m) scanf("%d", &S[i]), --S[i];
    rep(i, m) scanf("%d", &T[i]), --T[i];
    rep(i, m) scanf("%d", &Y[i]);
    rep(i, m) scanf("%d", &M[i]);
    rep(i, m) G[S[i]].emplace_back(T[i], Y[i], M[i]);

    rep(i, n)rep(j, C+1) d[i][j] = mod;
    d[0][C] = 0;
    rep(i, n)rep(j, C+1)if(d[i][j] < mod){
        for(auto &e: G[i])if(e.cost <= j){
            chmin(d[e.to][j-e.cost], d[i][j] + e.time);
        }
    }
    int ans = mod;
    rep(j, C+1) chmin(ans, d[n-1][j]);
    printf("%d\n", ans == mod ? -1 : ans);
}