//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
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;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, c,nn;
vector<ll> y,m;
vector<ll> s,t;
//ダイクストラ
//LINFにしてあるよ
struct edge
{
  ll to, cost;
};
typedef pair<ll, ll> P;
struct graph
{
  ll V;
  vector<vector<edge>> G;
  vector<ll> d;
  //vector<ll> count;経路の本数
  //vector<ll> prev; // prev[v] := v から復元できる辺たち
  graph(ll n)
  {
    init(n);
  }

  void init(ll n)
  {
    V = n;
    G.resize(V);
    d.resize(V);
    //count.resize(V);
    rep(i, V)
    {
      d[i] = LINF;
      //count[i] = 0;
    }
  }

  void add_edge(ll s, ll t, ll cost)
  {
    edge e;
    e.to = t, e.cost = cost;
    G[s].push_back(e);
  }

  void dijkstra(ll s)
  {
    rep(i, V)
    {
      d[i] = LINF;
      //count[i] = 0;
    }
    d[s] = 0;
    //count[s] = 1;
    priority_queue<P, vector<P>, greater<P>> que;
    que.push(P(0, s));
    while (!que.empty())
    {
      P p = que.top();
      que.pop();
      ll v = p.second;
      if (d[v] < p.first)
        continue;
      for (auto e : G[v])
      {
        if (d[e.to] > d[v] + e.cost)
        {
          d[e.to] = d[v] + e.cost;
          que.push(P(d[e.to], e.to));
          //count[e.to] = count[v];
          // 復元のための
          //prev[e.to]=v;
        }
        /*
        else if (d[e.to] == d[v] + e.cost)
                {
                    count[e.to] += count[v];
                    count[e.to] %= MOD;
                }
                */
      }
    }
  }
};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n>>c>>nn;
    y.resize(nn);
    m.resize(nn);
    s.resize(nn);
    t.resize(nn);
    graph g(n*(c+1));
    for (int i = 0; i < nn; i++)
    {
        cin>>s[i];
    }
    rep(i,nn){
        cin>>t[i];
    }
    rep(i,nn){
        cin>>y[i];
    }
    rep(i,nn){
        cin>>m[i];
    }
    rep(i,nn){
        rep(j,c){
            if(j+y[i]<=c){
                g.add_edge(s[i]-1+j*n,t[i]-1+n*(j+y[i]),m[i]);
            }
        }
    }
    g.dijkstra(0);
    ll ans=LINF;
    rep(i,c+1){
        chmin(ans,g.d[n-1+i*n]);
        //cout<<g.d[n-1+i*n]<<"\n";
    }
    if(ans==LINF)cout<<-1<<"\n";
    else
    cout << ans << "\n";
}