#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};

int dp[51][301];
int N,C,V;
int S[1501];
int T[1501];
int Y[1501];
int M[1501];

struct Edge{
    int To;
    int Cost;
    int Time;
};

vector<Edge> edges[1501];

static const int UpperValue = 1000000000;

void Calculate(int from, int cost, int time)
{
    FORR(edge, edges[from])
    {
        auto restCost = cost - edge.Cost;
        if(restCost >= 0)
        {
            auto next = time + edge.Time;
            if(dp[edge.To][restCost] > next)
            {
                dp[edge.To][restCost] = next;
                Calculate(edge.To, restCost, next);
            }
        }
    }
}

int main() {

    cin >> N;
    cin >> C;
    cin >> V;
    FOR(i, V)
    {
        cin >> S[i];
    }
    FOR(i, V)
    {
        cin >> T[i];
    }
    FOR(i, V)
    {
        cin >> Y[i];
    }
    FOR(i, V)
    {
        cin >> M[i];
    }
    FOR(i, V)
    {
        edges[S[i]].push_back({T[i],Y[i],M[i]});
    }
    FOR(i, 51) FOR(j, 301)
    {
        dp[i][j] = UpperValue;
    }
    dp[1][C] = 0;
    Calculate(1, C, 0);
    int minTime = UpperValue;
    FOR(j, 301)
    {
        minTime = min(minTime, dp[N][j]);
    }
    if(minTime == UpperValue)
    {
        cout << -1 << endl;
        return 0;
    }
    cout << minTime << endl;
    return 0;
}