#include <bits/stdc++.h>
using namespace std;

#define repu(i, begin, end) for (__typeof(begin) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define repe(i, begin, end) for (__typeof(begin) i = (begin); i != (end) + 1 - 2 * ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define mem(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define count_bits(x) __builtin_popcount(x)
#define count_bitsll(x) __builtin_popcountll(x)
#define least_bits(x) __builtin_ffs(x)
#define least_bitsll(x) __builtin_ffsll(x)
#define most_bits(x) 32 - __builtin_clz(x)
#define most_bitsll(x) 64 - __builtin_clz(x)

vector<string> split(const string &s, char c) {
	vector<string> v;
	stringstream ss(s);
	string x;
	while (getline(ss, x, c)) v.push_back(x);
	return v;
}

#define error(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); }

void err(vector<string>::iterator it) {}

template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
	cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n';
	err(++it, args...);
}

typedef long long ll;
const int MOD = 1000000007;

template<class T> inline T tmin(T a, T b) {return (a < b) ? a : b;}
template<class T> inline T tmax(T a, T b) {return (a > b) ? a : b;}
template<class T> inline void amax(T &a, T b) {if (b > a) a = b;}
template<class T> inline void amin(T &a, T b) {if (b < a) a = b;}
template<class T> inline T tabs(T a) {return (a > 0) ? a : -a;}
template<class T> T gcd(T a, T b) {while (b != 0) {T c = a; a = b; b = c % b;} return a;}

const int MAXV = 55, MAXC = 305, INF = (int) 1E8;
int dp[MAXV][MAXC]; 
int N, C, V;

struct SE {
    int to, cost, time;
};

vector<SE> G[MAXV];

class MyComp {
public:
    MyComp() {}
    bool operator() (const SE& x, const SE& y) const {
        return x.time < y.time;
    }
};

void solve() {
	priority_queue<SE, vector<SE>, MyComp> que;
    que.push((SE) {1, 0, 0});
    dp[1][0] = 0;
    while (!que.empty()) {
        SE st = que.top(); que.pop();
        if (dp[st.to][st.cost] < st.time) continue;
        int v = st.to;
        repu(i, 0, G[v].size()) {
            SE u = G[v][i];
            int x = dp[v][st.cost] + u.time;
            if (st.cost + u.cost <= C && dp[u.to][st.cost + u.cost] > x) {
                dp[u.to][st.cost + u.cost] = x;
                que.push((SE) {u.to, st.cost + u.cost, x});
            }
        }
    }
}

int main(int argc, char *argv[]) {
    ios_base::sync_with_stdio(false);
    int s[1501], t[1501], y[1501], m[1501];

    cin >> N >> C >> V;

    repu(i, 0, V) cin >> s[i];
    repu(i, 0, V) cin >> t[i];
    repu(i, 0, V) cin >> y[i];
    repu(i, 0, V) cin >> m[i];

    repe(i, 1, N) repe(c, 0, C) {
    	dp[i][c] = INF;
    }

    repu(i, 0, V) {
    	G[s[i]].push_back((SE) {t[i], y[i], m[i]});
    }

    solve();
    int ans = INF;
    repe(c, 0, C) {
    	amin(ans, dp[N][c]);
    }
    if (ans == INF) ans = -1;
    printf("%d\n", ans);

    return 0;
}