#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
constexpr i64 MOD = 1000000000;

struct edge {
    int from, to, cost, time;
};

int main() {
    int n, c, v;
    cin >> n >> c >> v;
    vector<edge> edges(v);
    for (int i = 0; i < v; i++) {
        int s;
        cin >> s;
        s--;
        edges[i].from = s;
    }
    for (int i = 0; i < v; i++) {
        int s;
        cin >> s;
        s--;
        edges[i].to = s;
    }
    for (int i = 0; i < v; i++) {
        int s;
        cin >> s;
        edges[i].cost = s;
    }
    for (int i = 0; i < v; i++) {
        int s;
        cin >> s;
        edges[i].time = s;
    }

    const int INF = 1e9;
    vvi dp(n, vi(c + 1, INF));
//    dp[i][j][k]: 街iにj円の状態でたどり着く最短時間
    
    dp[0][c] = 0;
    for (int i = 0; i < n; i++) {
        for (int k = 0; k <= c; k++) {
            for (edge& e: edges) {
                if (e.from == i && e.cost <= k) {
                    dp[e.to][k - e.cost] = min(dp[e.to][k - e.cost], dp[e.from][k] + e.time);
                }
            }
        }
    }
    
    i64 ans = 1e9;
    for (int i = 0; i <= c; i++) {
        ans = min(ans, dp[n - 1][i]);
    }
    cout << (ans == 1e9 ? -1 : ans) << endl;
}