#include <bits/stdc++.h>
using namespace std;

int d[50][400];
struct way{int id,re,ti;};
typedef pair<int,int> P;
typedef pair<int,P> IP;

signed main(){
  int n,c,v;cin>>n>>c>>v;
  vector<int> s(v),t(v),y(v),m(v);
  for(int i=0;i<v;i++){cin>>s[i];s[i]--;}
  for(int i=0;i<v;i++){cin>>t[i];t[i]--;}
  for(int i=0;i<v;i++)cin>>y[i];
  for(int i=0;i<v;i++)cin>>m[i];
  for(int i=0;i<50;i++)for(int j=0;j<400;j++)d[i][j]=1e9;
  vector<way> edge[n];
  for(int i=0;i<v;i++)edge[s[i]].push_back({t[i],y[i],m[i]});
  d[0][c]=0;
  priority_queue<IP,vector<IP>,greater<IP>> que;
  que.push(IP(0,P(0,c)));
  while(que.size()){
    IP p=que.top();que.pop();
    for(way q:edge[p.second.first]){
      int id=q.id;
      int re=p.second.second-q.re;
      int ti=p.first+q.ti;
      if(re>=0){
        if(d[id][re]>ti){
          d[id][re]=ti;
          que.push(IP(ti,P(id,re)));
        }
      }
    }
  }
  int ans=1e9;
  for(int j=0;j<=c;j++)if(ans>d[n-1][j])ans=d[n-1][j];
  cout<<(ans>1e8?-1:ans)<<endl;
}