use std::collections::{BinaryHeap, HashSet};
use std::cmp::Reverse;
#[derive(Default)]
//NOTE
//declare variables to reduce the number of parameters for dp and dfs etc.
struct Solver {}

type MinHeap<T> = BinaryHeap<Reverse<T>>;

impl Solver {
    fn solve(&mut self) {
        let stdin = std::io::stdin();
        let mut scn = Scanner {
            stdin: stdin.lock(),
        };
        let n: usize = scn.read();
        let m: usize = scn.read();
        let s: usize = scn.read();
        let mut edges = vec![vec![]; n];
        (0..m).for_each(|_| {
            let u: usize = scn.read();
            let v: usize = scn.read();
            let a: usize = scn.read();
            let b: usize = scn.read();
            edges[u-1].push((v - 1, a, b));
            edges[v-1].push((u - 1, a, b));
        });
        let cd: Vec<_> = (0..n).map(|_| {
            let c: usize = scn.read();
            let d: usize = scn.read();
            (c, d)
        }).collect();
        let mut min_heap = MinHeap::new();
        min_heap.push(Reverse((0, 0, std::cmp::min(s, 2500))));
        let mut visited = HashSet::new();
        let mut costs = vec![None; n];
        while let Some(p) = min_heap.pop() {
            let (cost, pos, coin) = p.0;
            //eprintln!("{:?}", p.0);
            if visited.contains(&(pos, coin)) {
                continue;
            }
            visited.insert((pos, coin));
            if let Some(c) = costs[pos] {
                if cost < c {
                    costs[pos] = Some(cost);
                }
            } else {
                costs[pos] = Some(cost);
            }
            //buy coins
            if coin + cd[pos].0 <= 2500 {
                min_heap.push(Reverse((cost + cd[pos].1, pos, coin + cd[pos].0)));
            }

            for &nxt in edges[pos].iter() {
                let (nxt, a, b) = nxt;
                if coin >= a {
                    if !visited.contains(&(nxt, coin - a)) {
                        min_heap.push(Reverse((cost + b, nxt, coin - a)));
                    }
                }
            }
        }
        for x in costs.iter().skip(1) {
            println!("{}", x.unwrap());
        }
    }

}

fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| {
            let mut solver = Solver::default();
            solver.solve()
        })
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 11536