#include <math.h>
#include <string.h>
#include <stdio.h>

#define	NMAX	(50)
#define VMAX	(1500)
#define INF		(99999999)


int cost[NMAX+5][NMAX+5];
int time[NMAX+5][NMAX+5];

int min(int a, int b){
	if(a<b){return a;}
	return b;
	
}

int main(void){
	int money;
	int i,j,k,n,v;
	int s[VMAX+5], t[VMAX+5], y[VMAX+5], m[VMAX+5];
	
	for(i=0;i<=NMAX;i++){
		for(j=0;j<=NMAX;j++){
			cost[i][j] = INF;
			time[i][j] = INF;
		}
	}
	
	scanf("%d", &n);
	scanf("%d", &money);
	scanf("%d", &v);
	
	for(i=0;i<v;i++){	scanf("%d", &s[i]);}
	for(i=0;i<v;i++){	scanf("%d", &t[i]);}
	for(i=0;i<v;i++){	scanf("%d", &y[i]);}
	for(i=0;i<v;i++){	scanf("%d", &m[i]);}
	for(i=0;i<v;i++){
		cost[s[i]][t[i]] = y[i];
		time[s[i]][t[i]] = m[i];
	}
	
	for(k=0;k<=n;k++){
		for(i=0;i<=n;i++){
			for(j=0;j<=n;j++){
				if(cost[i][k] + cost[k][j] > money){continue;}
				
				cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
				time[i][j] = min(time[i][j], time[i][k] + time[k][j]);
			}
		}
	}
	
	if( time[1][n] == INF ){
		printf("-1\n");
	}else{
		printf("%d\n", time[1][n]);
	}
	return 0;
}