#include<iostream>
using namespace std;
typedef long long ll;
const int N = 1510, INF = 2e9, M = 61, Q = 310;
int n, c, v;
int s[N], t[N], y[N], m[N];
int f[M][Q];

int main()
{
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
    cin >> n >> c >> v;
    for(int i = 1; i <= v; i ++ ) cin >> s[i];
    for(int i = 1; i <= v; i ++ ) cin >> t[i];
    for(int i = 1; i <= v; i ++ ) cin >> y[i];
    for(int i = 1; i <= v; i ++ ) cin >> m[i];
    for(int i = 1; i <= 50; i ++ )
        for(int j = 0; j <= 300; j ++ )
            f[i][j] = INF;
    f[1][c] = 0;
    for(int i = 1; i <= n; i ++ )
        for(int j = c; j >= 0; j -- )
        {
            if(f[i][j] != INF)
            {
                for(int k = 1; k <= v; k ++ )
                    if(i == s[k] && j - y[k] >= 0)
                f[t[k]][j - y[k]] = min(f[t[k]][j - y[k]], f[i][j] + m[k]);
            }
        }
    int mi = 2e9;
    for(int j = 0; j <= c; j ++ ) mi = min(mi, f[n][j]);
    if(mi == 2e9) cout << -1;
    else cout << mi;

    return 0;
}