#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
struct edge{int to,cost,dist;};
int s[1500],t[1500],c[1500],d[1500],inf=1e9;
vector<edge> G[50];
int main(){
	int N,C,M;
	cin>>N>>C>>M;
	rep(i,M) cin>>s[i];
	rep(i,M) cin>>t[i];
	rep(i,M) cin>>c[i];
	rep(i,M) cin>>d[i];
	rep(i,M){
		G[s[i]-1].pb({t[i]-1,c[i],d[i]});
	}
	int D[50][301]={};
	rep(i,N) rep(j,C+1) D[i][j]=inf;
	D[0][0]=0;
	rep(i,N-1) rep(j,C+1){
		for(auto e:G[i]){
			if(j+e.cost<=C) chmin(D[e.to][j+e.cost],D[i][j]+e.dist);
		}
	}
	int ans=inf;
	rep(j,C+1) chmin(ans,D[N-1][j]);
	if(ans==inf) ans=-1;
	cout<<ans<<endl;
}