use std::collections::BTreeSet;

fn main() {
    proconio::input! {
        n: u64,
        c: u64,
        v: u64,
        s: [u64; v],
        t: [u64; v],
        y: [u64; v],
        m: [u64; v],
    }

    let goal = n - 1;
    let s = s.into_iter().map(|s| s - 1).collect::<Vec<_>>();
    let t = t.into_iter().map(|t| t - 1).collect::<Vec<_>>();
    let mut stym = s
        .into_iter()
        .zip(t.into_iter())
        .zip(y.into_iter())
        .zip(m.into_iter())
        .map(|(((s, t), y), m)| (s, t, y, m))
        .collect::<Vec<_>>();
    stym.sort_unstable();

    let mut moves = BTreeSet::new();
    moves.insert((0, 0, 0));
    let mut mtime_min = u64::MAX;
    loop {
        let mut new_moves = BTreeSet::new();
        moves.into_iter().for_each(|(town, cost, mtime)| {
            stym.iter()
                .filter(|(s, _, y, _)| *s == town && cost + y <= c)
                .for_each(|(_, t, y, m)| {
                    if *t == goal {
                        mtime_min = std::cmp::min(mtime_min, m + mtime);
                    } else if mtime + m <= mtime_min {
                        new_moves.insert((*t, cost + y, mtime + m));
                    }
                });
        });
        moves = new_moves;
        if moves.is_empty() {
            break;
        }
    }
    if mtime_min == u64::MAX {
        println!("-1");
    } else {
        println!("{mtime_min}");
    }
}