#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

const int INF = 1e9;

struct data {
	int town;
	int cost;
	int minute;
};



int main() {
	int n, c, v;
	vector<int> s, t, y, m;

	cin >> n >> c >> v;

	s.assign(v, 0);
	t.assign(v, 0);
	y.assign(v, 0);
	m.assign(v, 0);

	int input;
	for (int i = 0; i < v; i++) {
		cin >> input;
		s[i] = input;
	}
	for (int i = 0; i < v; i++) {
		cin >> input;
		t[i] = input;
	}
	for (int i = 0; i < v; i++) {
		cin >> input;
		y[i] = input;
	}
	for (int i = 0; i < v; i++) {
		cin >> input;
		m[i] = input;
	}

	vector< vector< data > > connect; // town -> (town, cost, time)
	connect.assign(n + 1, vector<data>());

	for (int i = 0; i < v; i++) {
		data tmp = {t[i], y[i], m[i]};
		connect[s[i]].push_back(tmp);
	}

	// dp[town][cost] town に　cost以下 でこれる mintime
	vector < vector<int> > dp;
	dp.assign(n + 1, vector<int>(c + 1, INF));
	for (int i = 0; i <= c; i++) {
		dp[0][i] = 0;
	}

	queue<data> que;
	data pos = {1, 0, 0};
	que.push(pos);

	while (!que.empty()) {
		data pos = que.front();
		que.pop();

		if (dp[pos.town][pos.cost] <= pos.minute) {
			continue;
		}

		for (int i = pos.cost; i <= c; i++) {
			if (dp[pos.town][i] > pos.minute) {
				dp[pos.town][i] = pos.minute;
			}
		}

		int pt = pos.town;

		for (int i = 0; i < connect[pt].size(); i++) {
			if (connect[pt][i].cost + pos.cost <= c) {
				data tmp = {
					connect[pt][i].town,
					connect[pt][i].cost + pos.cost,
					connect[pt][i].minute + pos.minute
				};
				que.push(tmp);
			}
		}
	}

	int ans = dp[n][c];
	if (ans == INF) {
		ans = -1;
	}

	cout << ans << endl;
	return 0;
}