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

struct road {
	int s, t, y, m;
	bool operator<(const road& right) const {
		return s<right.s;
	}
};
int main() {
	int n, c, v;
	cin >> n >> c >> v;
	vector<road> r(v);
	for (int i = 0;i < v;i++) {
		cin >> r[i].s;
	}
	for (int i = 0;i < v;i++) {
		cin >> r[i].t;
	}
	for (int i = 0;i < v;i++) {
		cin >> r[i].y;
	}
	for (int i = 0;i < v;i++) {
		cin >> r[i].m;
	}

	sort(r.begin(), r.end());
	int mi = 1000000000;
	vector<queue<pair<int,int>>> q(v+1);
	int j = 0;
	q[1].push(pair<int,int>{ 0,0 });
	for (int i = 1;i < n;i++) {
		while (!q[i].empty()) {
			pair<int,int> qf = q[i].front();q[i].pop();
			for (int k = j;k < v&&r[k].s==i;k++) {
				if (qf.first + r[i].y <= c) {
					if (r[k].t == n) {
						mi = min(mi, qf.second + r[k].m);
					}
					else {
						q[r[k].t].push(pair<int,int>{qf.first + r[k].y,qf.second + r[k].m });
					}
				}
			}
		}
		for (;j < v&&r[j].s == i;j++);
	}

	cout << ((mi == 1000000000) ? -1 : mi) << endl;



	return 0;
}