#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 0
using ll = long long;
using ld = long double;
const int mod = 998244353;
#include <time.h>
#include <chrono>


int main() {
	int N, C, V;
	cin >> N >> C >> V;
	vector<vector<int>> path(N);
	vector<int>  T(V), Y(V), M(V);
	rep(i, 4) {
		rep(j, V) {
			if (i == 0) {
				int s;
				cin >> s;
				s--;
				path[s].push_back(j);
			}
			if (i == 1) {
				cin >> T[j];
				T[j]--;
			}
			if (i == 2) {
				cin >> Y[j];
			}
			if (i == 3) {
				cin >> M[j];
			}
		}
	}

	vector<vector<pair< int, int>>> ans(N);
	ans[0].push_back({ 0,0 });

	rep(i, N - 1) {
		for (int x : path[i]) {
			for (pair<int,int>p : ans[i]) {
				if (p.second + Y[x] <= C) {
					ans[T[x]].push_back({ p.first + M[x],p.second + Y[x] });
				}
			}
		}
	}

	if (ans[N - 1].empty()) {
		cout << -1 << endl;
	}
	else {
		sort(ans[N - 1].begin(), ans[N - 1].end());
		cout << ans[N - 1][0].first << endl;
	}
	
}