#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)	for(int i=0;i<n;i++)
int s[1600],t[1600],y[1600],m[1600];
int dp[60][350];
int main(){
	int n,c,v;	cin>>n>>c>>v;
	rep(i,v)	cin>>s[i];
	rep(i,v)	cin>>t[i];
	rep(i,v)	cin>>y[i];
	rep(i,v)	cin>>m[i];
	vector<tuple<int,int,int>> d[n];
	rep(i,v){
		d[s[i]-1].push_back(make_tuple(t[i]-1,y[i],m[i]));
	}
	rep(i,60)	rep(j,350)	dp[i][j]=1<<30;
	dp[0][c]=0;
	rep(i,n){
		rep(j,(int)d[i].size()){
			int to=get<0>(d[i][j]);
			int cost=get<1>(d[i][j]);
			int add=get<2>(d[i][j]);
			for(int k=c;k>=cost;k--){
				dp[to][k-cost]=min(dp[to][k-cost],dp[i][k]+add);
			}
		}
	}
	int ans=1<<30;
	rep(i,c+1)	ans=min(ans,dp[n-1][i]);
	if(ans==1<<30)	cout<<-1<<endl;
	else 	cout<<ans<<endl;
	return 0;
}