/*
 * 1.cc: 
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;
const int MAX_C = 300;
const int MAX_V = 1500;

const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

struct Stat {
  int d, i, y;
  Stat() {}
  Stat(int _d, int _i, int _y): d(_d), i(_i), y(_y) {}
  bool operator<(const Stat &s) const { return d > s.d; }
};

/* global variables */

int ss[MAX_V], ts[MAX_V], ys[MAX_V], ms[MAX_V];
vi nbrs[MAX_N];
int dists[MAX_N][MAX_C + 1];

/* subroutines */

/* main */

int main() {
  int n, c, v;
  cin >> n >> c >> v;

  for (int i = 0; i < v; i++) (cin >> ss[i]), ss[i]--;
  for (int i = 0; i < v; i++) (cin >> ts[i]), ts[i]--;
  for (int i = 0; i < v; i++) cin >> ys[i];
  for (int i = 0; i < v; i++) cin >> ms[i];

  for (int i = 0; i < v; i++) nbrs[ss[i]].push_back(i);

  for (int i = 0; i < n; i++)
    for (int j = 0; j <= c; j++) dists[i][j] = INF;
  dists[0][0] = 0;

  priority_queue<Stat> q;
  q.push(Stat(0, 0, 0));

  int mind = -1;
  
  while (! q.empty()) {
    Stat u = q.top(); q.pop();
    if (dists[u.i][u.y] != u.d) continue;
    if (u.i == n - 1) {
      mind = u.d;
      break;
    }

    vi &nbru = nbrs[u.i];
    for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int &vi = ts[*vit], vy = u.y + ys[*vit], vd = u.d + ms[*vit];
      if (vy <= c && dists[vi][vy] > vd) {
	dists[vi][vy] = vd;
	q.push(Stat(vd, vi, vy));
      }
    }
  }

  printf("%d\n", mind);
  return 0;
}