#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <complex>
#include <cassert>
#include <map>
#include <set>
#include <queue>
#include <tuple>
#include <limits>
#include <cstdint>

using namespace std;
const int INF = numeric_limits<int>::max() / 2 - 1;

int main()
{
	typedef tuple<int, int, int> edge;
	vector<vector<edge>> G;

	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];
		}
		G.assign(N, vector<edge>());
		for (int i = 0; i < V; i++) {
			G[S[i]].push_back(edge(T[i], Y[i], M[i]));
		}
	}

	vector<vector<int>> dp(N, vector<int>(C + 1, INF));
	dp[0][C] = 0;
	for (int i = 0; i<N; i++) {
		for (int j = 0; j <= C; j++) {
			if (dp[i][j] == INF)
				continue;
			for (int k = 0; k<(int)G[i].size(); k++) {
				int to, cost, time;
				tie(to, cost, time) = G[i][k];
				if (j < cost)
					continue;
				cost = j - cost;
				dp[to][cost] = min(dp[to][cost], time + dp[i][j]);
			}
		}
	}
	int ans = INF;
	for (int i = 0; i <= C; i++) {
		ans = min(ans, dp[N - 1][i]);
	}
	cout << (ans == INF ? -1 : ans) << endl;
	return 0;
}