#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 cost, time;
};

Edge E[MAX_N][MAX_N];
int Cos[MAX_N];
int Tim[MAX_N];

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

void dfs() {
	stack<int> stk;
	stk.push(1);
	while (!stk.empty()) {
		int v = stk.top(); stk.pop();
		for (int i = v + 1; i <= N; i++) {
			if (Cos[v] + E[v][i].cost <= C) {
				Cos[i] = Cos[v] + E[v][i].cost;
				Tim[i] = min(Tim[i], Tim[v] + E[v][i].time);
				stk.push(i);
			}
		}
	}
}

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 j = i + 1; j <= N; j++) {
			E[i][j].cost = INT16_MAX;
		}
	}
	for (int i = 2; i <= N; i++) Tim[i] = INT32_MAX;

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

	dfs();

	if (Tim[N] == INT32_MAX)cout << -1 << endl;
	else cout << Tim[N] << endl;

    return 0;
}