#include <bits/stdc++.h>
 
using namespace std;

struct PathType {
  int to;
  int cost, time;
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, c, v;
  cin >> n >> c >> v;
  vector<vector<int>> a(v, vector<int>(4));
  for (int i=0;i<v;++i) cin >> a[i][0];
  for (int i=0;i<v;++i) cin >> a[i][1];
  for (int i=0;i<v;++i) cin >> a[i][2];
  for (int i=0;i<v;++i) cin >> a[i][3];

  vector<vector<PathType>> path(n);
  for (int i=0;i<v;++i) {
    PathType ct;
    ct.to = a[i][1]-1; ct.cost = a[i][2]; ct.time = a[i][3];
    path[a[i][0]-1].push_back(ct);
  }
  priority_queue<pair<int, pair<int, int>>> pque;
  pque.push(make_pair(0, make_pair(0, c)));
  vector<vector<int>> score(n, vector<int>(c+1, -1));
  score[0][c] = 0;
  while (!pque.empty()) {
    pair<int, pair<int, int>> ct = pque.top(); pque.pop();
    for (const auto& e : path[ct.second.first]) {
      if (e.cost <= ct.second.second) {
        if (score[e.to][ct.second.second-e.cost] == -1 || e.time + ct.first < score[e.to][ct.second.second-e.cost]) {
          score[e.to][ct.second.second-e.cost] = e.time + ct.first;
          pque.push(make_pair(e.time+ct.first, make_pair(e.to, ct.second.second-e.cost)));
        }
      }
    }
  }
  //for (const auto& e : score) {
  //  for (const auto& f : e) {
  //    cout << f << ' ';
  //  }
  //  cout << '\n';
  //}

  int ans {-1};
  for (int i=0;i<=c;++i) {
    if (score[n-1][i] == -1) continue;
    if (ans == -1) ans = score[n-1][i];
    ans = min(ans, score[n-1][i]);
  }
  cout << ans << '\n';
}