#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define INF (100000007)

int N, C, V;
int S[1500], T[1500], Y[1500], M[1500];

vector<int> es[50];
int dp[50][301];

int main(int argc, char **argv) {
	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];
	REP(i, V) es[S[i]].push_back(i);
	REP(i, N) REP(j, C + 1) dp[i][j] = INF;
	dp[0][C] = 0;
	REP(s, N) FOR(c, 1, C + 1) {
		if (dp[s][c] >= INF) continue;
		REP(i, es[s].size()) {
			int e = es[s][i], t = T[e], y = c - Y[e];
			if (y >= 0) dp[t][y] = min(dp[t][y], dp[s][c] + M[e]);
		}
	}
	int res = INF;
	REP(c, C + 1) res = min(res, dp[N - 1][c]);
	cout << (res >= INF ? -1 : res) << endl;
	return 0;
}