#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

struct edge {
  int t, y, m;
  edge() {}
  edge(int t, int y, int m): t(t), y(y), m(m) {}
};

const int INF = 1 << 20;
int N, C, V;
int S[1500], T[1500], Y[1500], M[1500];
vector<edge> G[50];
int dis[50][301];

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  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]].emplace_back(T[i], Y[i], M[i]);
  }
  using P = tuple<int, int, int>;
  priority_queue<P, vector<P>, greater<P>> que;
  que.emplace(0, 0, C);
  fill_n((int*)dis, 50 * 301, INF);
  dis[0][C] = 0;
  while (!que.empty()) {
    int dd, cur, mon;
    tie(dd, cur, mon) = que.top(); que.pop();
    if (dis[cur][mon] < dd) continue;
    for (edge e : G[cur]) {
      int nxt = e.t;
      if (mon < e.y) continue;
      if (dis[nxt][mon - e.y] > dis[cur][mon] + e.m) {
        dis[nxt][mon - e.y] = dis[cur][mon] + e.m;
        que.emplace(dis[nxt][mon - e.y], nxt, mon - e.y);
      }
    }
  }
  int ans = INF;
  for (int i = 0; i <= C; i++) {
    ans = min(ans, dis[N - 1][i]);
  }
  cout << (ans == INF ? -1 : ans) << endl;

  return 0;
}