#include <bits/stdc++.h>
using namespace std;
#define bokusunny ios::sync_with_stdio(false), cin.tie(nullptr);

struct Edge {
  int to;
  int y;
  int m;

  Edge(const int to, const int y, const int m) : to(to), y(y), m(m) {}
};
using Graph = vector<vector<Edge>>;

void solve() {
  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];

  Graph G(N);
  for (int i = 0; i < V; i++) {
    G[S[i]].emplace_back(T[i], Y[i], M[i]);
  }

  const int INF = 1 << 30;
  using Tup = tuple<int, int, int>;
  priority_queue<Tup, vector<Tup>, greater<Tup>> pq;
  vector Dist(N, vector<int>(C + 1, INF));
  pq.emplace(0, 0, 0);
  Dist[0][0] = 0;

  while (!pq.empty()) {
    auto [cm, cv, cy] = pq.top();
    pq.pop();

    if (Dist[cv][cy] < cm) continue;

    for (auto [nv, y, m] : G[cv]) {
      if (cy + y > C) continue;
      if (Dist[nv][cy + y] <= cm + m) continue;

      pq.emplace(cm + m, nv, cy + y);
      Dist[nv][cy + y] = cm + m;
    }
  }

  int ans = *min_element(Dist[N - 1].begin(), Dist[N - 1].end());

  if (ans == INF) {
    cout << -1 << endl;
  } else {
    cout << ans << endl;
  }
}

int main() {
  bokusunny;
  solve();

  return 0;
}