#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;

int main() {
	int n,c,v;
	array<array<pii, 50>, 50> graph = {};
	scanf("%d %d %d", &n, &c, &v);
	vector<pii> roads(v, {0,0});
	for (int i = 0; v > i; i++) {
		int s;
		scanf("%d", &s);
		roads[i].first = s-1;
	}
	for (int i = 0; v > i; i++) {
		int s;
		scanf("%d", &s);
		roads[i].second = s-1;
	}
	for (int i = 0; v > i; i++) {
		int s;
		scanf("%d", &s);
		graph[roads[i].first][roads[i].second].first = s;
	}
	for (int i = 0; v > i; i++) {
		int s;
		scanf("%d", &s);
		graph[roads[i].first][roads[i].second].second = s;
	}

	array<array<int, 301>, 51> 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 (int k = i + 1; n > k; k++) {
					if (graph[i][k].first && j - graph[i][k].first >= 0) {
						dp[k][j - graph[i][k].first] = min(dp[k][j - graph[i][k].first], dp[i][j] + graph[i][k].second);
					}
				}
			}
		}
	}
	int ans = *min_element(dp[n - 1].begin(), dp[n - 1].end());
	if (ans == INT_MAX)
		ans = -1;
	printf("%d\n", ans);
	return 0;
}