#include<iostream>
#include<vector>
using namespace std;

int main(){
  int n,c,v;
  cin >> n >> c >> v;
  
  vector<int> s(v);
  for(int i=0;i<v;i++)cin >> s[i], s[i]--;

  vector< vector<int> > t(n),y(n),m(n);
  for(int i=0;i<v;i++){
    int T; cin >> T; T--;
    t[s[i]].push_back(T);
  }
  for(int i=0;i<v;i++){
    int Y; cin >> Y;
    y[s[i]].push_back(Y);
  }
  for(int i=0;i<v;i++){
    int M; cin >> M;
    m[s[i]].push_back(M);
  }

  vector< vector<int> > dp(n, vector<int>(c+1,1e9));
  dp[0][c] = 0;
  for(int i=0;i<n;i++){
    for(int j=0;j<=c;j++){
      if(dp[i][j] == 1e9)continue;
      for(int k=0;k<(int)t[i].size();k++){
	int to = t[i][k], cost = j-y[i][k];
	if(cost>=0){
	  dp[to][cost] = min(dp[to][cost], dp[i][j]+m[i][k]);
	}
      }
    }
  }

  int ans = 1e9;
  for(int i=0;i<=c;i++)ans = min(ans,dp[n-1][i]);
  if(ans == 1e9)cout << -1 << endl;
  else cout << ans << endl;
}