import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) {
	      BufferedReader stdReader =new BufferedReader(new InputStreamReader(System.in));
	      try {
	    	  int N = Integer.parseInt(stdReader.readLine());
	    	  int C = Integer.parseInt(stdReader.readLine());
	    	  int V = Integer.parseInt(stdReader.readLine());
	    	  String[] temp1 = stdReader.readLine().split(" ");
	    	  String[] temp2 = stdReader.readLine().split(" ");
	    	  String[] temp3 = stdReader.readLine().split(" ");
	    	  String[] temp4 = stdReader.readLine().split(" ");
	    	  int[] S = new int[V+1];
	    	  int[] T = new int[V+1];
	    	  int[] Y = new int[V+1];
	    	  int[] M = new int[V+1];
	    	  
	    	  for(int i=1;i<V+1;i++){
	    		  S[i] = Integer.parseInt(temp1[i-1]);
	    		  T[i] = Integer.parseInt(temp2[i-1]);
	    		  Y[i] = Integer.parseInt(temp3[i-1]);
	    		  M[i] = Integer.parseInt(temp4[i-1]);
	    	  }
	    	  int[][] dp = new int[N+1][C+1];

	    	  for(int i=1;i<N+1;i++){
	    		  Arrays.fill(dp[i], Integer.MAX_VALUE);
	    	  }
	    	  dp[1][C] = 0;
	    	  
	    	  for(int i=1;i<N+1;i++){
	    		  for(int j=1;j<V+1;j++){
	    			  if(S[j] == i){
		    			  for(int k=0;k<C+1;k++){
		    				  if(dp[i][k]!=Integer.MAX_VALUE && k-Y[j]>=0){
		    					  if(dp[T[j]][k-Y[j]] > dp[i][k]+M[j]){
		    						  dp[T[j]][k-Y[j]] = dp[i][k]+M[j];
		    					  }
		    				  }
		    			  }
	    			  }
	    		  }
	    	  }    	  
	    	  int ans = Integer.MAX_VALUE;
	    	  for(int i=0;i<C+1;i++){
	    		  ans = Math.min(ans,dp[N][i]);
	    	  }
	    	  if(ans != Integer.MAX_VALUE){
	    		  System.out.println(ans);
	    	  }else{
	    		  System.out.println(-1);
	    	  }
	    	  
	      } catch (IOException e) {
			e.printStackTrace();
	      }
	}
}