#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>

using namespace std;

struct S_load {
	int pnext;
	int cost;
	int time;
};

class C_node {
public:
	long int scost;
	long int stime;
	bool operator<(const C_node& arg) const {
		if (this->stime < arg.stime) return true;
		if (this->stime > arg.stime) return false;
		if (this->scost > arg.scost) return false;
		return true;
	}
};

int N, C, V;
int S[1510], T[1510], Y[1510], M[1510];
bool qflag[1510];
vector<S_load> pnext[1510];
set<C_node> node[1510];
queue<int> ready;

int main() {
	int i;

	// input
	cin >> N;
	cin >> C;
	cin >> V;
	for (i = 0; i < V; i++) cin >> S[i];
	for (i = 0; i < V; i++) cin >> T[i];
	for (i = 0; i < V; i++) cin >> Y[i];
	for (i = 0; i < V; i++) cin >> M[i];

	for (i = 0; i < V; i++) {
		S_load tempload;
		tempload.pnext = T[i];
		tempload.cost = Y[i];
		tempload.time = M[i];
		pnext[S[i]].push_back(tempload);
	}
	for (i = 1; i <= N; i++) qflag[i] = false;

	// implement
	ready.push(1);
	C_node tempnode;
	tempnode.scost = C;
	tempnode.stime = 0;
	node[1].insert(tempnode);

	while (!ready.empty()) {

		int now = ready.front(); ready.pop();

		if (now == N) continue;

		qflag[now] = false;
		vector<S_load>::iterator it;

		for (it = pnext[now].begin(); it != pnext[now].end(); it++) {

			set<C_node>::iterator itc;

			for (itc = node[now].begin(); itc != node[now].end(); itc++) {

				C_node tempnode;
				tempnode.scost = (*itc).scost - (*it).cost;

				if (tempnode.scost >= 0) {
					tempnode.stime = (*itc).stime + (*it).time;
					node[(*it).pnext].insert(tempnode);
					if (!qflag[(*it).pnext]) {
						qflag[(*it).pnext] = true;
						ready.push((*it).pnext);
					}
				}

			}

		}
		node[now].clear();
	}

	if (!node[N].empty()) {
		set<C_node>::iterator it = node[N].begin();
		cout << (*it).stime << endl;
	} else {
		cout << "-1" << endl;
	}

	return 0;
}