#include <iostream>
#include <algorithm>
#include <vector>
#include <list>
#include <cstdio>
#include <cmath>

using namespace std;

int n,c,nv;
vector<int> vs;
vector<int> vt;
vector<int> vy;
vector<int> vm;

int main(){
    int i,j;
    cin>>n>>c>>nv;
    list<vector<int>> queue;
    
    for (i=0;i<nv;i++){
        cin>>j;
        vs.push_back(j);
    }for (i=0;i<nv;i++){
        cin>>j;
        vt.push_back(j);
    }for (i=0;i<nv;i++){
        cin>>j;
        vy.push_back(j);
    }for (i=0;i<nv;i++){
        cin>>j;
        vm.push_back(j);
    }
    queue.push_back(vector<int>{1,0,0});
    for (;!queue.empty();queue.pop_front()){
        vector<int> &v=queue.front();
        if (v[1]>c) continue;
        if (v[0]==n){
            cout<<v[2]<<endl;
            return 0;
        }
        for (i=0;i<nv;i++){
            if (vs[i]==v[0]){
                queue.push_back(vector<int>{vt[i],v[1]+vy[i],v[2]+vm[i]});
            }
        }
        queue.sort([](vector<int> &le,vector<int> &re){return (le[2]<re[2]);} );
    }
    cout<<"-1"<<endl;
    
    return 0;
}