#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
#endif
using ll = long long;
using ld = long double;
const ll INF = 1ll<<60;
const ld EPS = 1.0/1e9;
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define del(x) sort(all(x)); x.erase(unique(all(x)),x.end());

struct Edge{
  int to,id; ll y,m;
  Edge(int to,ll y,ll m,int id):to(to),y(y),m(m),id(id){}
};

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ll n,c,v; cin >> n >> c >> v;
  vector<ll>s(v);
  rep(i,0,v){
    cin >> s[i]; s[i]--;
  }
  vector<ll>t(v);
  rep(i,0,v){
    cin >> t[i]; t[i]--;
  }
  vector<ll>y(v);
  rep(i,0,v) cin >> y[i];
  vector<ll>m(v);
  rep(i,0,v) cin >> m[i];
  vector<vector<Edge>>G(n);
  rep(i,0,v){
    G[s[i]].push_back(Edge(t[i],y[i],m[i],i));
  }
  vector<vector<ll>>dp(n,vector<ll>(c+2,INF));
  dp[0][0]=0;
  queue<ll>que; que.push(0);
  map<ll,bool>f;
  while(!que.empty()){
    ll x=que.front(); que.pop();
    fore(u,G[x]){
      rep(C,0,c){
        if(dp[u.to][min(c+1,C+u.y)]>dp[x][C]+u.m) dp[u.to][min(c+1,C+u.y)]=dp[x][C]+u.m;
        else continue;
      }
      que.push(u.to);
      f[u.id]=true;
    }
  }
  ll ans=INF;
  rep(i,0,c+1){
    ans=min(ans,dp[n-1][i]);
  }
  if(ans==INF) cout << -1 << endl;
  else cout << ans << endl;
}