/**
	author:  shobonvip
	created: 2025.02.14 20:18:54
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, c, v; cin >> n >> c >> v;
	vector<int> s(v), t(v), y(v), m(v);
	rep(i,0,v) {cin >> s[i]; s[i]--;}
	rep(i,0,v) {cin >> t[i]; t[i]--;}
	rep(i,0,v) cin >> y[i];
	rep(i,0,v) cin >> m[i];
	vector ikeru(n, vector<int>(0));
	vector dp(n, vector<int>(c+1, (int)1e9));
	rep(i,0,v) {
		ikeru[s[i]].push_back(i);
	}
	dp[0][0] = 0;
	priority_queue<tuple<int,int,int>> pq;
	pq.push(make_tuple(0, 0, 0));
	while(!pq.empty()){
		auto [tmp,i,f] = pq.top();
		pq.pop();
		tmp = -tmp;
		if(tmp > dp[i][f]) continue;
		for (int x: ikeru[i]) {
			int j = t[x];
			if (f+y[x] > c) continue;
			if (chmin(dp[j][f+y[x]], dp[i][f] + m[x])) {
				pq.push(make_tuple(-dp[j][f+y[x]], j, f+y[x]));
			}
		}
	}	

	int ans = 1e9;
	rep(i,0,c+1) {
		chmin(ans, dp[n-1][i]);
	}
	if (ans == (int)1e9) {
		cout << -1 << '\n';
	}else{
		cout << ans << '\n';
	}


}