#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int dp[51][301];
const int inf = 1e9;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,c,v; cin >> n >> c >> v;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=c;j++){
            dp[i][j] = inf;
        }
    }
    vector<vector<int>> g(n);
    for(int i=0;i<v;i++){
        int s; cin >> s;
        g[s-1].push_back(i);
    }
    vector<int> t(v),y(v),m(v);
    for(int i=0;i<v;i++){
        cin >> t[i]; t[i]--;
    }
    for(int i=0;i<v;i++){
        cin >> y[i];
    }
    for(int i=0;i<v;i++){
        cin >> m[i];
    }
    dp[0][0] = 0;
    for(int i=0;i<n;i++){
        for(int j=0;j<=c;j++){
            if(dp[i][j] == inf)continue;
            for(int idx:g[i]){
                int nxi = t[idx];
                int nxj = j+y[idx];
                if(nxj <= c){
                    dp[nxi][nxj] = min(dp[nxi][nxj], dp[i][j]+m[idx]);
                }
            }
        }
    }
    int res = inf;
    for(int i=0;i<=c;i++){
        res = min(res,dp[n-1][i]);
    }
    if(res == inf)res = -1;
    cout << res << endl;
}