#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define pb eb
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define all2(i,j,v) for(auto& [i,j] : v)
template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

// cin.tie(nullptr);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(20);

void solve(){
  ll n,c,v;
  cin >> n >> c >> v;
  V<ll> s(v), t(v), y(v), m(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];
  VV<tuple<ll,ll,ll>> G(n);
  rep(i,v) G[s[i]-1].eb(t[i]-1, y[i], m[i]);
  
  VV<ll> dist(n, V<ll>(c+1, INF));
  dist[0][c] = 0;
  set<tuple<ll,ll,ll>> st;
  st.insert({0, 0, c});
  while(!st.empty()){
  	auto[d, nd, c] = *st.begin();
  	st.erase(st.begin());
  	if(d != dist[nd][c]) continue;
  	for(auto[to, y, m]:G[nd]) if(c >= y && dist[to][c-y] > d+m){
  		dist[to][c-y] = d+m;
  		st.insert({d+m, to, c-y});
  	}
  }
  ll ans = INF;
  rep(i,c+1) chmin(ans, dist[n-1][i]);
  if(ans == INF) ans = -1;
  cout << ans << endl;
  
  
}





int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t=1;
  // cin >> t;
  rep(i,t) solve();
}