#include<iostream>
#include<vector>
#include<queue>
#include<tuple>
#include<algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using tu = tuple<int, int, int>;

int main(void){
  int n, c, v; cin >> n >> c >> v;
  vector<int> s(v), t(v), y(v), m(v);
  for(int i=0; i<v; i++) cin >> s[i], s[i]--;
  for(int i=0; i<v; i++) cin >> t[i], t[i]--;
  for(int i=0; i<v; i++) cin >> y[i];
  for(int i=0; i<v; i++) cin >> m[i];
  vector<vector<vector<P>>> to(n, vector<vector<P>>(n));
  for(int i=0; i<v; i++){
    to[s[i]][t[i]].emplace_back(m[i], y[i]);
    //to[t[i]][s[i]]=min(to[t[i]][s[i]], {m[i], y[i]});
  }
  vector<P> dist(n, {1e8, 1e8});
  priority_queue<tu, vector<tu>, greater<tu>> dij;
  dij.emplace(0, 0, 0);
  dist[0]={0, 0};
  while(dij.size()){
    auto [time, cost, idx]=dij.top(); dij.pop();
    if(dist[idx]!=P(time, cost)) continue;
    for(int i=0; i<n; i++){
      for(auto [dt, dc]:to[idx][i]){
        if(cost+dc>c) continue;
        if(dist[i]>P(time+dt, cost+dc)){
          dist[i]=P(time+dt, cost+dc);
          dij.emplace(time+dt, cost+dc, i);
        }
      }
    }
  }
  if(dist[n-1].second<=c) cout << dist[n-1].first << endl;
  else cout << -1 << endl;
  return 0;
}