#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

struct X{
  int cost;
  int time;
};
int N;
int C,V;
vector <pair <int,X> > edge[60];
int S[1560],T[1560],Y[1560],M[1560];
int memo[60][310];
bool in_que[60][310];
int ans = INF;


int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  rep(i,60){
    rep(j,310){
      memo[i][j] = INF;
    }
  }
  cin >> N;
  cin >> C;
  cin >> V;
  rep(i,V){
    cin >> S[i];
  }
  rep(i,V){
    cin >> T[i];
  }
  rep(i,V){
    cin >> Y[i];
  }
  rep(i,V){
    cin >> M[i];
  }
  rep(i,V){
    X x;
    x.cost = Y[i];
    x.time = M[i];
    edge[S[i]].pb(mp(T[i],x));
  }

  queue <pair <int,int> > que;
  que.push(mp(1,0));
  memo[1][0] = 0;
  in_que[1][0] = true;
  while(!que.empty()){
    auto t = que.front();
    auto now = t.fir;
    auto now_cost = t.sec;
    auto now_time = memo[now][now_cost];
    //DEBUG3(now,now_cost,now_time);
    que.pop();
    in_que[now][now_cost] = false;
    numa(u,edge[now]){
      if(now_cost + u.sec.cost > C){
        continue;
      }
      if(memo[u.fir][now_cost+u.sec.cost] == INF){
        memo[u.fir][now_cost+u.sec.cost] = now_time + u.sec.time;
        que.push(mp(u.fir,now_cost+u.sec.cost));
        in_que[u.fir][now_cost+u.sec.cost] = true;
      }else if(memo[u.fir][now_cost+u.sec.cost] > now_time + u.sec.time){
        memo[u.fir][now_cost+u.sec.cost] = now_time + u.sec.time;
        if(!in_que[u.fir][now_cost+u.sec.cost]){
          que.push(mp(u.fir,now_cost+u.sec.cost));
        }
      }
    }
  }
  int ans = INF;
  for (int c = 0; c <= C; c++) {
    ans = min(ans,memo[N][c]);
  }
  if(ans == INF){
    ans = -1;
  }
  cout << ans <<endl;
  return 0;
}