#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cstring>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define MAX_N 51

int N, C, V;

struct Edge {
	int to, cost, time;
};

vector<Edge> E[MAX_N];
int DP[301][51];

void add_edge(int a, int b, int c,int t) {
	E[a].push_back({ b,c,t });
}

int main()
{
	cin >> N >> C >> V;
	vector<int> S(V), T(V), Y(V), M(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];

	for (int i = 1; i <= N; i++) {

	}
	for (int i = 0; i <= C; i++) {
		for (int j = 1; j <= N; j++) {
			DP[i][j] = INT32_MAX;
		}
	}

	for (int i = 0; i < V; i++) {
		add_edge(S[i], T[i], Y[i], M[i]);
	}

	DP[C][1] = 0;

	for (int i = C; i >= 0; i--) {
		for (int j = 1; j <= N; j++) {
			if (DP[i][j] == INT32_MAX) continue;

			for (int k = 0; k < E[j].size(); k++) {
				if (i - E[j][k].cost < 0)continue;
				DP[i - E[j][k].cost][E[j][k].to] = min(DP[i - E[j][k].cost][E[j][k].to], DP[i][j] + E[j][k].time);
			}
		}
	}

	int mn = INT32_MAX;
	for (int i = 0; i <= C; i++) {
		mn = min(mn, DP[i][N]);
	}
	if (mn == INT32_MAX) cout << -1 << endl;
	else cout << mn << endl;

	return 0;
}