#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>
#include <queue>
#include <algorithm>

#define fir first
#define sec second
#define get(n) scanf("%d",&n);
#define gets(s) string s;cin >> (s);
#define All(s) (c).begin(), (c).end()
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define rep(i, j) for (int (i)=0;(i)<(j);(i)++)
#define repk(i, j, k) for(int (i)=(j);(i)<(k);(i)++)
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
using namespace std;
typedef long long int ll;
const ll INF = 10241024;
const int MOD = 1e9 + 7;
int N,C,V;

struct edge
{
    int from, to, cost, longa;
};

vector<vector<edge>> dist(51);

void input(){
    cin >> N >> C >> V;
    int b[V];
    edge a[V];
    rep(i, V){
        cin >> a[i].from;
    }
    rep(i,V){ 
        cin >> a[i].to;a[i].to--;
    }
    rep(i,V) cin >> a[i].cost;
    rep(i,V)cin >> a[i].longa;

    rep(i,V)
    {
        dist[a[i].from].push_back(a[i]);
    }
}

void solve(){
    input();
    int dp[N][C];//i番目に行くときc円で行ったならそのとき掛かった時間の最小値をdp[i][c]とする
    rep(i,N)rep(j,C) dp[i][j] = INF;
    dp[0][0] = 0;
    queue<edge> q;
    for(int i=0;i<dist[0].size();i++){
        q.push(dist[0][i]);
    }
    int loc = 0;
    while(!q.empty())
    {
        edge e = q.front();q.pop();
        for(int i=0;i<dist[e.to].size();i++){
            q.push(dist[e.to][i]);
        }
        for(int i=0;i<C;i++){
            if(i+e.cost > C) break;
            if(dp[e.to][i+e.cost] != INF)
            {
                chmin(dp[e.to][i+e.cost], dp[e.from][i] + e.cost)
            }
            else 
            {
                dp[e.to][i+e.cost] = e.cost;
            }
            
        }
    }

    int ans = INF;
    rep(i,C){
        chmin(ans ,dp[N][i]);
    }

    cout << ans << endl;
}
int main () {
    solve();
    return 0;
}