#include <bits/stdc++.h>
using namespace std;
const int INF = 100000000;
int main(){
  int N;
  cin >> N;
  int C;
  cin >> C;
  int V;
  cin >> V;
  vector<int> S(V);
  for (int i = 0; i < V; i++){
    cin >> S[i];
    S[i]--;
  }
  vector<int> T(V);
  for (int i = 0; i < V; i++){
    cin >> T[i];
    T[i]--;
  }
  vector<int> Y(V);
  for (int i = 0; i < V; i++){
    cin >> Y[i];
  }
  vector<int> M(V);
  for (int i = 0; i < V; i++){
    cin >> M[i];
  }
  vector<vector<int>> edge(N);
  for (int i = 0; i < V; i++){
    edge[S[i]].push_back(i);
  }
  vector<vector<int>> dp(N, vector<int>(C + 1, INF));
  dp[0][C] = 0;
  for (int i = 0; i < N; i++){
    for (int j : edge[i]){
      for (int k = Y[j]; k <= C; k++){
        dp[T[j]][k - Y[j]] = min(dp[T[j]][k - Y[j]], dp[i][k] + M[j]);
      }
    }
  }
  int ans = INF;
  for (int i = 0; i <= C; i++){
    ans = min(ans, dp[N - 1][i]);
  }
  if (ans == INF){
    cout << -1 << endl;
  } else {
    cout << ans << endl;
  }
}