#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

using namespace std;
typedef vector<int> Ivec;
typedef pair<int, int> pii;

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

int main() {
	int n,c,v;
	scanf("%d %d %d", &n, &c, &v);
	vector<vector<edge>> graph(n, vector<edge>());
	vector<int> S, T, Y, M;
	for (int i = 0; v > i; i++) {
		int s;
		scanf("%d", &s);
		S.push_back(s-1);
	}
	for (int i = 0; v > i; i++) {
		int t;
		scanf("%d", &t);
		T.push_back(t-1);
	}
	for (int i = 0; v > i; i++) {
		int y;
		scanf("%d", &y);
		Y.push_back(y);
	}
	for (int i = 0; v > i; i++) {
		int m;
		scanf("%d", &m);
		M.push_back(m);
	}

	for (int i = 0; v > i; i++) {
		graph[S[i]].push_back({T[i], Y[i], M[i]});
	}

	array<array<int, 301>, 55> dp;
	for (auto itr = dp.begin(); itr != dp.end(); itr++) {
		fill(itr->begin(), itr->end(), INT_MAX);
	}
	dp[0][c] = 0;
	for (int i = 0; n-1 > i; i++) {
		for (int j = 0; c >= j; j++) {
			if (dp[i][j] != INT_MAX) {
				for (auto itr = graph[i].begin(); itr != graph[i].end(); itr++) {
					if (j - itr->cost >= 0) {
						dp[itr->to][j - itr->cost] = min(dp[itr->to][j - itr->cost], dp [i] [j] + itr->time);
					}
				}
			}
		}
	}
	int ans = *min_element(dp[n - 1].begin(), dp[n - 1].end());
	printf("%d\n", ans == INT_MAX ? -1 : ans);
	return 0;
}