#![allow(unused_imports, unused_macros, dead_code)]

macro_rules! min {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| min!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = min!($($ys),*);
        if $x < t { $x } else { t }
    }}
}
macro_rules! max {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        it.next().map(|z| it.fold(z, |x, y| max!(x, y)))
    }};
    ($x:expr) => ($x);
    ($x:expr, $($ys:expr),*) => {{
        let t = max!($($ys),*);
        if $x > t { $x } else { t }
    }}
}
macro_rules! ewriteln {
    ($($args:expr),*) => { let _ = writeln!(&mut std::io::stderr(), $($args),*); };
}
macro_rules! trace {
    ($x:expr) => { ewriteln!(">>> {} = {:?}", stringify!($x), $x) };
    ($($xs:expr),*) => { trace!(($($xs),*)) }
}
macro_rules! put {
    (.. $x:expr) => {{
        let mut it = $x.iter();
        if let Some(x) = it.next() { print!("{}", x); }
        for x in it { print!(" {}", x); }
        println!("");
    }};
    ($x:expr) => { println!("{}", $x) };
    ($x:expr, $($xs:expr),*) => { print!("{} ", $x); put!($($xs),*) }
}

const M: i64 = 1_000_000_007;
const S: usize = 3000;

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.cin();
    let m: usize = sc.cin();
    let s: usize = min!(S, sc.cin::<usize>());

    let mut g = vec![vec![]; n];
    let mut ex = vec![];

    for _ in 0..m {
        let u = sc.cin::<usize>() - 1;
        let v = sc.cin::<usize>() - 1;
        let a: usize = sc.cin();  // 枚数
        let b: i64 = sc.cin();  // 時間
        g[u].push((v, a, b));
        g[v].push((u, a, b));
    }
    for _ in 0..n {
        let c: usize = min!(S, sc.cin::<usize>());
        let d: i64 = sc.cin();
        ex.push((c, d));
    }

    let mut memo = vec![vec![Inf; S + 2]; n];  // memo[i][k] = i 地点に k 枚持っての最小時間
    let s = min!(s, S);
    memo[0][s] = Real(0);

    let mut stack = std::collections::BinaryHeap::new();
    use std::cmp::Reverse;

    stack.push((Reverse(memo[0][s]), 0, s));
    while let Some((_, u, s)) = stack.pop() {
        // trace!(u, s);

        {
            let k = s + ex[u].0;
            let val = memo[u][s] + Real(ex[u].1);
            if k < S && memo[u][k] > val {
                memo[u][k] = val;
                // trace!(k, val);
                stack.push((Reverse(val), u, k));
            } else if k >= S && memo[u][S] > val {
                // trace!(S, val);
                memo[u][S] = val;
                stack.push((Reverse(val), u, S));
            }
        }

        for &(v, a, b) in g[u].iter() {
            if s < a { continue }
            let val = memo[u][s] + Real(b);
            if memo[v][s - a] > val {
                memo[v][s - a] = val;
                // trace!((v, s - a), val);
                stack.push((Reverse(val), v, s - a));
            }
        }
    }

    for u in 1..n {
        let mut ans = Inf;
        for t in 0..S {
            ans = min!(ans, memo[u][t]);
        }
        put!(ans.unwrap());
    }

}

trait Group: std::ops::Add<Output=Self> + std::ops::Sub<Output=Self> + std::ops::Neg<Output=Self>
    + std::iter::Sum + Clone + Copy {
    fn zero() -> Self;
}
impl Group for i32 { fn zero() -> Self { 0 }}
impl Group for i64 { fn zero() -> Self { 0 }}
impl Group for f32 { fn zero() -> Self { 0.0 }}
impl Group for f64 { fn zero() -> Self { 0.0 }}

trait Ring: Group + std::ops::Mul<Output=Self> + std::ops::Div<Output=Self> {
    fn one() -> Self;
}
impl Ring for i32 { fn one() -> Self { 1 }}
impl Ring for i64 { fn one() -> Self { 1 }}
impl Ring for f32 { fn one() -> Self { 1.0 }}
impl Ring for f64 { fn one() -> Self { 1.0 }}

#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Debug)]
enum Hyper<X> { NegInf, Real(X), Inf }
use Hyper::{Real, NegInf, Inf};
impl<X> Hyper<X> {
    fn unwrap(self) -> X { if let Hyper::Real(x) = self { x } else { panic!() } }
}
impl<X: Ring> std::ops::Add for Hyper<X> {
    type Output = Self;
    fn add(self, rhs: Hyper<X>) -> Hyper<X> {
        match (self, rhs) {
            (Real(x), Real(y)) => Real(x + y),
            (Inf, _) => Inf,
            (_, Inf) => Inf,
            _ => NegInf,
        }
    }
}
impl<X: Ring> std::ops::Sub for Hyper<X> {
    type Output = Self;
    fn sub(self, rhs: Hyper<X>) -> Hyper<X> { self + (-rhs) }
}
impl<X: Ring> std::ops::Neg for Hyper<X> {
    type Output = Self;
    fn neg(self) -> Hyper<X> {
        match self {
            Inf => NegInf,
            NegInf => Inf,
            Real(x) => Real(-x),
        }
    }
}

use std::io::{self, Write};
use std::str::FromStr;
use std::collections::VecDeque;

struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
impl Scanner {
    fn new() -> Self { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn cin<T: FromStr>(&mut self) -> T {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
        self.buffer.pop_front().unwrap().parse::<T>().ok().unwrap()
    }
    fn chars(&mut self) -> Vec<char> { self.cin::<String>().chars().collect() }
    fn vec<T: FromStr>(&mut self, n: usize) -> Vec<T> { (0..n).map(|_| self.cin()).collect() }
}


Measured memory_bytes: 7400