#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
const int INF=1e9;
struct edge{int end,cost,time;};
vector<vector<edge>>G(50);
int dp[50];
int ans=INF;
int N,C,V;
void dfs(int v,int c,int t){
   if(dp[v]<t)return;
   dp[v] = t;
   for (auto &&i : G[v]){
      if(c<i.cost)continue;
      dfs(i.end,c-i.cost,t+i.time);
   }
}
int main() {
   cin>>N>>C>>V;
   vector<int>S(V),T(V),Y(V),M(V);
   rep(i,V)cin>>S[i];
   rep(i,V)cin>>T[i];
   rep(i,V)cin>>Y[i];
   rep(i,V)cin>>M[i];
   rep(i,N)dp[i]=INF;dp[0]=0;
   rep(i,V){
      edge e;
      e.end=T[i]-1;e.cost=Y[i];e.time=M[i];
      G[S[i]-1].push_back(e);
   }
   dfs(0,C,0);
   cout<<dp[N-1]<<endl;
}