#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v, y, m; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N, C, V;
	cin >> N >> C >> V;
	vector< vector<edge> > G(N);
	vector<int> S(V), T(V), Y(V), M(V);
	for (int i = 0; i < V; i++)
		cin >> S[i];
	for (int i = 0; i < V; i++)
		cin >> T[i];
	for (int i = 0; i < V; i++)
		cin >> Y[i];
	for (int i = 0; i < V; i++)
		cin >> M[i];
	for (int i = 0; i < V; i++) {
		S[i]--; T[i]--;
		edge e = {S[i], T[i], Y[i], M[i]};
		G[S[i]].push_back(e);
	}
	vector< vector<int> > dp(N, vector<int>(C + 1));
	for (int u = N - 2; u >= 0; u--)
		for (int c = 0; c <= C; c++) {
			dp[u][c] = INT_MAX / 2;
			for (int i = 0; i < G[u].size(); i++) {
				int v = G[u][i].v, y = G[u][i].y, m = G[u][i].m;
				if (c - y < 0) continue;
				dp[u][c] = min(dp[u][c], dp[v][c - y] + m);
			}
		}
	int x = dp[0][C];
	cout << (x < INT_MAX / 2 ? x : -1) << endl;
}