#include <bits/stdc++.h>
using namespace std;

#define int long long



#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define low(a,b) lower_bound(all(a),(b))
#define upp(a,b) upper_bound(all(a),(b))
#define fill(i,n) memset(i,n,sizeof(i))
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<vint> vvint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;

signed main() {
    IOS();
    int n,c,w;
    cin>>n>>c>>w;
    using T=tuple<int,int,int>;
    std::vector<vector<T>>G(n) ;
    
    vector<int> s(w),t(w),y(w),m(w);
    rep(i,0,w)cin>>s[i];
    rep(i,0,w)cin>>t[i];
    rep(i,0,w)cin>>y[i];
    rep(i,0,w)cin>>m[i];
    rep(i,0,w){
        s[i]--,t[i]--;
        G[s[i]].emplace_back(t[i],y[i],m[i]);
    }
    
    vector<vint> dp(n,vint(c+1,INF));
    priority_queue<T,vector<T>,greater<T>> que;
    
    dp[0][0]=0;
    que.emplace(dp[0][0],0,0);
    
    while(!que.empty()){
        int v,x,d;
        tie(d,v,x)=que.top();que.pop();
        //cout<<d<<" "<<v<<" "<<x<<":"<<dp[v][x]<<endl;
        if(dp[v][x]<d)continue;
        for(T e:G[v]){
            int u,y,m;
            tie(u,y,m)=e;
            int nx=x+y,nd=d+m;
            if(nx>c)continue;
            if(dp[u][nx]>nd){
                dp[u][nx]=nd;
                que.emplace(dp[u][nx],u,nx);
            }
        }
    }
    
    int ans=INF;
    rep(x,0,c+1)chmin(ans,dp[n-1][x]);
    
    if(ans>=INF)ans=-1;
    cout<<ans<<endl;




















































    return 0;
}