#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <functional>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)
#define CLEAR(d) memset((d), 0, (sizeof((d))))
#define ALL(c) (c).begin(), (c).end()
#define ABS(x) ((x < 0) ? -(x) : (x))
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define SIZE(a) ((int)((a).size()))
#define MAX3(a, b, c) (max(max((a), (b)), (c)))
#define MIN3(a, b, c) (min(min((a), (b)), (c)))
#define MOD 1000000007
#define EPS 1e-5
#define PI  (acos(-1))
#define INF 10000000
//===================================================
struct edge { int to, cost, time; };
vector<edge> ed[51];

int main()
{
    int n, c, v, time[51], cost[51];
    cin >> n >> c >> v;
    vector<int> s(v), t(v), y(v), m(v);
    REP(i, v) cin >> s[i];
    REP(i, v) cin >> t[i];
    REP(i, v) cin >> y[i];
    REP(i, v) {
        cin >> m[i];
        edge e = { t[i], y[i], m[i] };
        ed[s[i]].push_back(e);
    }
    REP(i, 51) {
        time[i] = INF; cost[i] = INF;
    }
    queue<int> q;
    q.push(1);
    time[1] = cost[1] = 0;
    while (!q.empty()) {
        int now = q.front(); q.pop();
        for (int i = 0; i < ed[now].size(); i++) {
            edge e = ed[now][i];
            if (time[now] + e.time < time[e.to]) {
                if (cost[now] + e.cost <= c) {
                    cost[e.to] = cost[now] + e.cost;
                    time[e.to] = time[now] + e.time;
                    q.push(e.to);
                }
            }
        }
    }
    if (time[n] == INF) time[n] = -1;
    printf("%d\n", time[n]);
    return 0;
}