#include<iostream>
#include<queue>
#include<vector>
#include<tuple>
#define INF 1000000000
using namespace std;

using T = tuple<int, int, int>;

int N, C, V, s[1500], t[1500], y[1500], m[1500], d[100];
bool done[100];
vector<T> g[100];
int main()
{
  fill(d, d + 100, INF);

  cin >> N >> C >> V;
  for(int i = 0; i < V; i++)
    cin >> s[i];
  for(int i = 0; i < V; i++)
    cin >> t[i];
  for(int i = 0; i < V; i++)
    cin >> y[i];
  for(int i = 0; i < V; i++)
    cin >> m[i];
  for(int i = 0; i < V; i++)
  {
    s[i]--; t[i]--;
    g[s[i]].push_back(make_tuple(m[i], y[i], t[i]));
    g[t[i]].push_back(make_tuple(m[i], y[i], s[i]));
  }

  priority_queue<T, vector<T>, greater<T>> q;
  q.push(make_tuple(0, 0, 0));
  while(q.size())
  {
    auto t = q.top(); q.pop();
    auto n = get<2>(t);
    done[n] = true;
    for(auto e: g[n])
    {
      auto to = get<2>(e);
      auto dist = get<0>(t) + get<0>(e);
      auto cost = get<1>(t) + get<1>(e);
      if(done[to] || d[to] < dist || cost > C)
        continue;
      d[to] = dist;
      q.push(make_tuple(dist, cost, to));
    }
  }
  cout << (d[N - 1] == INF ? -1 : d[N - 1]) << endl;
}