#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

const int MAX_N = 55;
struct Edge{ int to, cost, time; };
vector<Edge> es[MAX_N];
const int MAX_C = 1510;
int times[MAX_N][MAX_C];

int main(){
    int n, money, m;
    cin >> n >> money >> m;
    vector<int> a(m), b(m), c(m), d(m);
    rep(i, m) {
        cin >> a[i];
        --a[i];
    }
    rep(i, m) {
        cin >> b[i];
        --b[i];
    }
    rep(i, m) cin >> c[i];
    rep(i, m) cin >> d[i];

    rep(i, m) {
        es[a[i]].pb({b[i], c[i], d[i]});
    }
    rep(i, MAX_N) rep(j, MAX_C) times[i][j] = INF;
    times[0][money] = 0;
    rep(i, n) {
        REP(j, 1, money+1) {
            for(const auto& e : es[i]) {
                if(e.cost > j) continue;
                int nxt_i = e.to, nxt_c = j - e.cost;
                times[nxt_i][nxt_c] = min(times[nxt_i][nxt_c], times[i][j] + e.time);
            }
        }
    }
    int ans = INF;
    rep(i, money+1) ans = min(ans, times[n-1][i]);
    cout << (ans == INF ? -1 : ans) << endl;

    return 0;
}