function main(): void {
    const input = require('fs').readFileSync(0, 'utf-8').trim().split(/\s+/);
    let index = 0;
    
    const [N, C, V] = [input[index++], input[index++], input[index++]].map(Number);
    
    // Read all arrays in one go
    const arrays = [[], [], [], []];
    for (let i = 0; i < 4; i++) {
        for (let j = 0; j < V; j++) {
            arrays[i].push(Number(input[index++]));
        }
    }
    
    const [S, T, Y, M] = arrays;
    S.forEach((val, i) => S[i] = val - 1); // Adjust S indices
    T.forEach((val, i) => T[i] = val - 1); // Adjust T indices
    
    // Build graph
    const graph: Array<Array<[number, number, number]>> = Array(N).fill(0).map(() => []);
    for (let i = 0; i < V; i++) {
        graph[S[i]].push([T[i], Y[i], M[i]]);
    }
    
    // DP setup
    const INF = 1e9;
    const dp = Array(N).fill(0).map(() => Array(C + 1).fill(INF));
    dp[0][C] = 0;
    
    // Process DP
    for (let i = 0; i < N; i++) {
        for (let k = C; k >= 0; k--) {
            if (dp[i][k] === INF) continue;
            
            for (const [to, cost, time] of graph[i]) {
                if (k >= cost) {
                    dp[to][k - cost] = Math.min(dp[to][k - cost], dp[i][k] + time);
                }
            }
        }
    }
    
    // Output result
    const result = Math.min(...dp[N - 1]);
    console.log(result === INF ? -1 : result);
}