import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int C = sc.nextInt();
    int V = sc.nextInt();
    int[] s = new int[V];
    int[] t = new int[V];
    int[] y = new int[V];
    int[] m = new int[V];
    int[][] cost = new int[N][N];
    int[][] time = new int[N][N];
    for(int i = 0; i < V; i++) {
      s[i] = sc.nextInt() - 1;
    }
    for(int i = 0; i < V; i++) {
      t[i] = sc.nextInt() - 1;
    }
    for(int i = 0; i < V; i++) {
      y[i] = sc.nextInt();
    }
    for(int i = 0; i < V; i++) {
      m[i] = sc.nextInt();
    }
    for(int i = 0; i < V; i++) {
      cost[s[i]][t[i]] = y[i];
      time[s[i]][t[i]] = m[i];
    }
    // dp[i][j]は頂点iで金額j円持っている状態に行く最小時間を表す(不可能なら-1とする)
    int[][] dp = new int[N][C + 1];
    for(int i = 1; i < N; i++) {
      for(int j = 0; j < C + 1; j++) {
        int min = -1;
        for(int k = 0; k < i; k++) {
          if((cost[k][i] != 0) && (j + cost[k][i] < C + 1)) {
            if(dp[k][j + cost[k][i]] != -1) {
              if(min == -1) {
                min = dp[k][j + cost[k][i]] + time[k][i];
              } else {
                min = Math.min(min, dp[k][j + cost[k][i]] + time[k][i]);
              }
            }
          }
        }
        dp[i][j] = min;
      }
    }
    int ans = Integer.MAX_VALUE;
    for(int j = 0; j < C + 1; j++) {
      if(dp[N - 1][j] > 0) ans = Math.min(ans, dp[N - 1][j]);
    }
    if(ans == Integer.MAX_VALUE) ans = -1;
    System.out.println(ans);
  }
}