const input = require('fs').readFileSync(0, 'utf-8').trim().split(/\s+/).map(Number);
let idx = 0;

const [N, C, V] = [input[idx++], input[idx++], input[idx++]];
const S = input.slice(idx, idx + V).map(x => x - 1); idx += V;
const T = input.slice(idx, idx + V).map(x => x - 1); idx += V;
const Y = input.slice(idx, idx + V); idx += V;
const M = input.slice(idx, idx + V); idx += V;

const graph = Array.from({length: N}, () => []);
for (let i = 0; i < V; i++) graph[S[i]].push([T[i], Y[i], M[i]]);

const INF = 1e9;
const dp = Array.from({length: N}, () => Array(C + 1).fill(INF));
dp[0][C] = 0;

for (let i = 0; i < N; i++) {
    for (let k = C; k >= 0; k--) {
        if (dp[i][k] === INF) continue;
        for (const [t, c, tm] of graph[i]) {
            if (k >= c) dp[t][k - c] = Math.min(dp[t][k - c], dp[i][k] + tm);
        }
    }
}

const result = Math.min(...dp[N - 1]);
console.log(result === INF ? -1 : result);