//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

struct edge {
  int to;
  int64_t cost;
  edge(int x=0, int64_t y=0):to(x), cost(y) {}
};

vector<vector<edge> > G; // resizeの必要あり


struct dijkstra {
  vector<int64_t> d;
  dijkstra(int s, int n):d(n, INT64_MAX/3) { // sはスタート,nは頂点数
    d[s] = 0LL;
    priority_queue<pair<int64_t, int>, vector<pair<int64_t, int> >, greater<pair<int64_t, int> > > que;
    que.push(make_pair(0LL, s));
    while(!que.empty()) {
      pair<int64_t, int> now = que.top();
      que.pop();
      if(now.first != d[now.second]) continue;
      for(edge next:G[now.second]) {
        if(d[next.to] > d[now.second] + next.cost) {
          d[next.to] = d[now.second] + next.cost;
          que.push(make_pair(d[next.to], next.to));
        }
      }
    }
  }
  int64_t &operator[](int idx) {return d[idx];}
  const int64_t &operator[](int idx) const {return d[idx];}
};

const int N = 1510;

//head

int n, c, v;
int s[N], t[N], y[N], m[N];

inline int num(int money, int where) {
  return money + where * (c+1);
}

inline void add(int p1, int p2, int mo1, int mo2, int ti) {
  G[num(mo1, p1)].emplace_back(num(mo2, p2), ti);
  //G[num(mo1, p2)].emplace_back(num(mo2, p1), ti);
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> c >> v;
  rep(i, v) cin >> s[i];
  rep(i, v) {
    cin >> t[i];
    s[i]--;
    t[i]--;
  }
  rep(i, v) cin >> y[i];
  rep(i, v) cin >> m[i];

  const int X = (c+1)*n;

  G.resize(X);
  rep(i, v) {
    rep(j, c-y[i]+1) {
      add(s[i], t[i], j+y[i], j, m[i]);
    }
  }
  dijkstra D(c, X);
  ll ans = INT64_MAX;
  rep(i, c+1) {
    chmin(ans, D[num(i, n-1)]);
  }
  cout << (ans == INT64_MAX/3?-1:ans) << endl;
}