#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
const int inf = 1e9;
int N,C,V;
int S[2000],T[2000],Y[2000],M[2000];
struct edge {
  int to, cost, times;
  edge(int a, int b, int c) {
    to = a, cost = b, times = c;
  }
};
vector<vector<edge> > G;
int dp[60][301];

int main()
{
  cin >> N >> C >> V;
  G.resize(N+1);
  FOR(i,0,V) cin >> S[i];
  FOR(i,0,V) cin >> T[i];
  FOR(i,0,V) cin >> Y[i];
  FOR(i,0,V) cin >> M[i];
  G[0].push_back(edge(1,0,0));
  FOR(i,0,V) {
    G[S[i]].push_back(edge(T[i],Y[i],M[i]));
  }
  FOR(i,0,60) FOR(j,0,301) dp[i][j] = inf;
  dp[0][0] = 0;
  // 幅優先で
  queue<int> Q;
  Q.push(0);
  while(!Q.empty()) {
    int v = Q.front();Q.pop();
    for(edge &e : G[v]) {
      bool next = false;
      FOR(i,0,301) {
        if(dp[v][i] == inf) continue;
        if(i + e.cost > 300) continue;
        if(dp[e.to][i + e.cost] > dp[v][i] + e.times) {
          next = true;
          dp[e.to][i + e.cost] = dp[v][i] + e.times;
        }
      }
      if(next) Q.push(e.to);
    }
  }
  int mn = inf;
  FOR(i,1,C+1) {
    mn = min(mn, dp[N][i]);
  }
  cout << (mn == inf ? -1 : mn) << endl;
  return 0;
}