import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try (Scanner scan = new Scanner(System.in)) {
            int N = scan.nextInt();
            int C = scan.nextInt();
            int V = scan.nextInt();
            
            int inFrom[] = new int[V];
            int inTo[] = new int[V];
            int inCost[] = new int[V];
            int inTime[] = new int[V];
            
            for(int i=0; i<V; i++) inFrom[i] = Integer.parseInt(scan.next());
            for(int i=0; i<V; i++) inTo[i] = Integer.parseInt(scan.next());
            for(int i=0; i<V; i++) inCost[i] = Integer.parseInt(scan.next());
            for(int i=0; i<V; i++) inTime[i] = Integer.parseInt(scan.next());
            
            ArrayList<Path> pathList = new ArrayList<>();
            for(int i=0; i<V; i++) {
                Path path = new Path(inFrom[i], inTo[i], inCost[i], inTime[i]);
                pathList.add(path);
            }
                        
            int minTime[][] = new int[N+1][C+1];
            for(int i=1; i<=N; i++) {
                for(int j=0; j<=C; j++) {
                    if(i==1 && j==C) {
                        minTime[i][j] = 0;
                    } else {
                        minTime[i][j] = Integer.MAX_VALUE;
                    }
                }
            }
            
            for(int place = 1; place <= N; place++) { 
                for(int i=C; i>=0; i--) {
                    if(minTime[place][i] != Integer.MAX_VALUE) {
                        int cost = i;
                        int time = minTime[place][i];
                        
                        for(Path path : pathList) {
                            if(path.start == place) {
                                int nextPlace = path.end;
                                int nextCost = cost - path.cost;
                                int nextTime = time + path.time;
                                if(nextCost < 0) continue;
                                minTime[nextPlace][nextCost] = Math.min(minTime[nextPlace][nextCost], nextTime);
                            }
                        }
                    }
                }
            }
            
            int ans = Integer.MAX_VALUE;
            for(int i=0; i<=C; i++) {
                ans = Math.min(minTime[N][i], ans);
            }
            
            if(ans == Integer.MAX_VALUE) {
                System.out.println(-1);
            } else {
                System.out.println(ans);
            }
        }
    }
}

class Path {
    int start;
    int end;
    int cost;
    int time;
    Path(int start, int end, int cost, int time) {
        this.start = start;
        this.end = end;
        this.cost = cost;
        this.time = time;
    }
}