#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
inline int in() { int x; scanf("%d",&x); return x;}
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 1505, MC = 305, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

int a[MX], b[MX], d[MX], t[MX];
int dp[55][MC];
vi to[55];

int ord[55], o;
bool used[55];
void dfs(int v) {
  if (used[v]) return;
  used[v] = true;
  for (int i : to[v]) {
    dfs(b[i]);
  }
  ord[--o] = v;
}

int main(){
  int n, c, m;
  cin >> n >> c >> m;
  rep(i,m) cin >> a[i];
  rep(i,m) cin >> b[i];
  rep(i,m) cin >> d[i];
  rep(i,m) cin >> t[i];
  rep(i,m) {
    a[i]--; b[i]--;
    to[a[i]].pb(i);
  }
  rep(i,n) rep(j,c+1) dp[i][j] = INF;
  dp[0][0] = 0;
  o = n;
  rep(i,n) dfs(i);
  rep(i,n) {
    int v = ord[i];
    rep(j,c+1) {
      if (dp[v][j] == INF) continue;
      for(int e : to[v]) {
        int u = b[e];
        int nc = j+d[e];
        if (nc <= c) dp[u][nc] = min(dp[u][nc],dp[v][j]+t[e]);
      }
    }
  }
  int ans = INF;
  rep(i,c+1) ans = min(ans,dp[n-1][i]);
  if (ans == INF) ans = -1;
  cout << ans << endl;
  return 0;
}