#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
struct vertice { 
	ll nd; int id, m;
	bool operator<(const vertice &v)const {
		if (v.nd != nd)return v.nd > nd;
		if (v.id != id)return v.id > id;
		return v.m > m;
	}
};
ll d[50][301];
void init(){
	rep(i, 50) {
		rep(j, 301) {
			d[i][j] = mod;
		}
	}
}
struct edge { int to, t, m; };
vector<edge> G[50];
int n, c, v, s[1500], t[1500], y[1500], m[1500];
int main(){
	init();
	cin >> n >> c >> v;
	rep(i, v)cin >> s[i];
	rep(i, v)cin >> t[i];
	rep(i, v)cin >> y[i];
	rep(i, v)cin >> m[i];
	rep(i, v) {
		G[s[i] - 1].push_back({ t[i] - 1,m[i],y[i] });
	}
	priority_queue<vertice> q;
	d[0][c] = 0; q.push({ 0,0,c });
	while (!q.empty()) {
		vertice x = q.top(); q.pop();
		rep(j, (int)G[x.id].size()) {
			int to = G[x.id][j].to;
			int nc = x.m - G[x.id][j].m;
			if (nc < 0)continue;
			ll nt = x.nd + G[x.id][j].t;
			if (nt < d[to][nc]) {
				d[to][nc] = nt;
				q.push({ nt,to,nc });
			}
		}
	}
	ll out = mod;
	rep(i, c + 1) {
		out = min(out, d[n - 1][i]);
	}
	if (out == mod)cout << -1 << endl;
	else cout << out << endl;
	return 0;
}