#include "bits/stdc++.h"
using namespace std;
#define MAX 99999999

int main() {
	int N, C, V;
	cin >> N >> C >> V;
	vector<int> S(V), T(V), Y(V), M(V);
	for (int i = 0; i < V; i++)
	{
		cin >> S[i]; S[i]--;
	}
	for (int i = 0; i < V; i++)
	{
		cin >> T[i]; T[i]--;
	}
	for (int i = 0; i < V; i++)
	{
		cin >> Y[i];
	}
	for (int i = 0; i < V; i++)
	{
		cin >> M[i];
	}

	vector<vector<tuple<int, int, int>>> e(N);
	for (int i = 0; i < N; i++)
	{
		e[S[i]].push_back(make_tuple(T[i], Y[i], M[i]));
		e[S[i]].push_back(make_tuple(T[i], Y[i], M[i]));
	}
	vector<vector<int>> dp(N, vector<int>(C + 1, -MAX));
	dp[0][C] = 0;
	priority_queue<tuple<int, int, int>> pq;
	pq.push(make_tuple(0, 0, C));
	while (!pq.empty()){
		auto now = pq.top(); pq.pop();
		int d = get<0>(now);
		int pos = get<1>(now);
		int cost = get<2>(now);
		if (dp[pos][cost] != d) continue;
		if (pos == N - 1){
			cout << -d << endl;
			return 0;
		}

		for (auto i: e[pos])
		{
			int nd = d - get<2>(i);
			int npos = get<0>(i);
			int nc = cost - get<1>(i);
			if (nc < 0) continue;
			if (dp[npos][nc] < nd){
				dp[npos][nc] = nd;
				pq.push(make_tuple(nd, npos, nc));
			}
		}
	}
	cout << -1 << endl;
}