#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

struct Edge{
    ll to;
    ll cost_time;
    ll cost_money;
    Edge(){}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N,C,V;cin>>N>>C>>V;

    vector<vector<Edge>> G(N);
    
    VI S(V);
    rep(i, V){
      cin>>S[i];
      S[i]--;
    }
    
    VI T(V);
    rep(i, V){
      cin>>T[i];
      T[i]--;
    }

    // money
    VI Y(V);
    rep(i, V){
      cin>>Y[i];
    }

    // time
    VI M(V);
    rep(i, V){
      cin>>M[i];
    }

    // 有効辺をはる
    rep(i, V){
      auto edge = Edge();
      edge.to = T[i];
      edge.cost_money = Y[i];
      edge.cost_time = M[i];
      G[S[i]].push_back(edge);
    }

    // dp[i][j]
    // i : city
    // j : そこまでにかかったコスト
    // dp: 最短時間
    VV dp(N, VI(100000, inf));
    rep(i, 100000){
      dp[0][i] = 0;
    }
    rep(city, N){
      rep(spent_money, 50001){
        if(dp[city][spent_money]==inf) continue;
        for(auto edge : G[city]){
          chmin(dp[edge.to][spent_money+edge.cost_money], dp[city][spent_money] + edge.cost_time);
        }        
      }
    }

    ll mi = inf;
    rep(money, C+1){
      chmin(mi, dp[N-1][money]);
    }

    if(mi==inf){
      p(-1);
    }else{
      p(mi);
    }

    return 0;
}