#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  int n, C, m;
  cin >> n >> C >> m;
  vector g(n, vector<T>());
  {
    vector<int> s(m);
    rep(i, m) cin >> s[i];
    vector<int> t(m);
    rep(i, m) cin >> t[i];
    vector<int> y(m);
    rep(i, m) cin >> y[i];
    vector<int> d(m);
    rep(i, m) cin >> d[i];

    rep(i, m) {
      int v = s[i], u = t[i], nc = y[i], nd = d[i];
      --v, --u;
      g[v].emplace_back(u, nc, nd);
      g[u].emplace_back(v, nc, nd);
    }
  }

  const int INF = 1001001001;
  vector dist(n, vector<int>(C + 5, INF));
  priority_queue<T, vector<T>, greater<T>> q;
  auto push = [&](int u, int nd, int nc) {
    if (nc > C) return;
    if (dist[u][nc] <= nd) return;
    dist[u][nc] = nd;
    q.emplace(nd, nc, u);
  };
  push(0, 0, 0);
  while (sz(q)) {
    auto [d, c, v] = q.top();
    q.pop();
    if (dist[v][c] != d) continue;
    for (auto [u, nc, nd] : g[v]) { push(u, d + nd, c + nc); }
  }

  int ans = INF;
  rep(i, C + 1) ans = min(ans, dist[n - 1][i]);
  if (ans == INF) ans = -1;
  cout << ans << endl;
  return 0;
}