#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define P(p) cout<<(p)<<endl;
using namespace std;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ll gcd(ll a, ll b){
	if (b > a)swap(a, b); if (b == 0)return a; else{ return gcd(b, a%b); }
}

void solve() {
	int n, c, v, s[2000], t[2000], y[2000], m[2000];
	cin >> n >> c >> v;
	rep(i, v){
		cin >> s[i];
		s[i]--;
	}
	rep(i, v){ 
		cin >> t[i]; 
		t[i]--;
	}
	rep(i, v)cin >> y[i];
	rep(i, v)cin >> m[i];
	vector<vector<tuple<int, int, int>>> edge(n);
	rep(i, v){
		edge[s[i]].push_back(make_tuple(t[i], y[i], m[i]));
	}
	vector<vector<int>> dp(n, vector<int>(c + 1, 100000));
	dp[0][c] = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < c + 1; j++)
		{
			if (dp[i][j] == 100000) continue;
			for (auto k : edge[i])
			{
				int nextC = j - get<1>(k);
				if (nextC < 0) continue;
				int nextI = get<0>(k);
				dp[nextI][nextC] = min(dp[nextI][nextC], dp[i][j] + get<2>(k));
			}
		}
	}
	int mini = 100000;
	rep(i, c + 1){
		mini = min(mini, dp[n-1][i]);
	}
	P(mini == 100000 ? -1 : mini);
}

int main() {
	solve();
	return 0;
}