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

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

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

    pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> {
        (0..row).map(|_| self.chars()).collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

#[derive(Clone)]
struct Edge(usize, usize, usize);

const INF: usize = 1 << 60;
const MAX: usize = 50;

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let M: usize = sc.get();
    let S: usize = sc.get();
    let mut adj = vec![Vec::new(); N];
    for _ in 0..M {
        let U: usize = sc.get::<usize>()-1;
        let V: usize = sc.get::<usize>()-1;
        let A: usize = sc.get();
        let B: usize = sc.get();
        adj[U].push(Edge(V, A, B));
        adj[V].push(Edge(U, A, B));
    }
    let mut exchange = Vec::new();
    for _ in 0..N {
        let C: usize = sc.get();
        let D: usize = sc.get();
        exchange.push((C, D));
    }
    let mut dp = vec![vec![INF; MAX * MAX + 1]; N];
    dp[0][min(MAX * MAX, S)] = 0;
    let mut bh = BinaryHeap::new();
    bh.push((Reverse(0usize), 0usize, min(MAX * MAX, S)));
    while let Some((Reverse(cost), now, coin)) = bh.pop() {
        if dp[now][coin] < cost {
            continue;
        }
        for &Edge(to, fare, time) in &adj[now] {
            if coin >= fare {
                if dp[to][coin - fare] > dp[now][coin] + time {
                    dp[to][coin - fare] = dp[now][coin] + time;
                    bh.push((Reverse(cost + time), to, coin - fare));
                }
            }
        }
        let (C, D) = exchange[now];
        if coin + C <= MAX * MAX && dp[now][coin + C] > dp[now][coin] + D {
            dp[now][coin + C] = min(dp[now][coin + C], dp[now][coin] + D);
            bh.push((Reverse(cost + D), now, coin + C));
        }
    }
    for t in 1..N {
        let mut ans = INF;
        for c in 0..=MAX*MAX {
            ans = min(ans, dp[t][c]);
        }
        println!("{}", ans);
    }
}


Measured memory_bytes: 4696