#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  Int n,c,w;
  cin>>n>>c>>w;
  using T = tuple<Int, Int, Int>;
  vector<vector<T> > G(n);
  {
    vector<Int> s(w),t(w),y(w),m(w);
    for(Int i=0;i<w;i++) cin>>s[i];
    for(Int i=0;i<w;i++) cin>>t[i];
    for(Int i=0;i<w;i++) cin>>y[i];
    for(Int i=0;i<w;i++) cin>>m[i];
    for(Int i=0;i<w;i++){
      s[i]--;t[i]--;
      G[s[i]].emplace_back(t[i],y[i],m[i]);
    }
  }
  
  const Int INF = 1e8;
  vector<vector<Int> > dp(n,vector<Int>(c+1,INF));
  priority_queue<T, vector<T>, greater<T> > pq;

  dp[0][0]=0;
  pq.emplace(dp[0][0],0,0);

  while(!pq.empty()){
    Int v,x,d;    
    tie(d,v,x)=pq.top();pq.pop();
    //cout<<d<<" "<<v<<" "<<x<<":"<<dp[v][x]<<endl;
    if(dp[v][x]<d) continue;
    for(T e:G[v]){
      Int u,y,m;
      tie(u,y,m)=e;
      Int nx=x+y,nd=d+m;
      if(nx>c) continue;
      if(dp[u][nx]>nd){
        dp[u][nx]=nd;
        pq.emplace(dp[u][nx],u,nx);
      }
    }
  }
  
  Int ans=INF;
  for(Int x=0;x<=c;x++) 
    chmin(ans,dp[n-1][x]);
  
  if(ans>=INF) ans=-1;
  cout<<ans<<endl;
  return 0;
}