#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($t:tt),*; $n:expr) => {{
		let stdin = ::std::io::stdin();
		let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
			let line = line.unwrap();
			let mut it = line.split_whitespace();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
	};
	($it:ident; [usize1]) => {
		$it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
	};
	($it:ident; [$t:ty]) => {
		$it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
	};
	($it:ident; $t:ty) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}

pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX/2;

fn calc_id(node: usize, val: i64) -> usize{
	node*3000+min(val,2999) as usize
}

fn id_to_node (id: usize) -> (usize,usize) {
	(id/3000,id%3000)
}

fn solve() {
	let (n,m,s) = read!(usize, usize, i64);
	let uvab = read!(usize,usize,i64,i64;m);
	let cd = read!([i64];n);
	let mut edge = vec![vec![];3000*n];
	for (u,v,a,b) in uvab {
		for j in 0..3000_i64 {
			edge[calc_id(u-1,j+a)].push((b,calc_id(v-1,j)));
			edge[calc_id(v-1,j+a)].push((b,calc_id(u-1,j)));
		}
	}
	for i in 0..n {
		for j in 0..3000_i64 {
			edge[calc_id(i,j)].push((cd[i][1],calc_id(i,j+cd[i][0])));
		}
	}
	let mut q = BinaryHeap::new();
	let mut dist = vec![INF;3000*n];
	let begin = calc_id(0,s);
	dist[begin] = 0;
	q.push(Reverse((0,begin)));
	while let Some(Reverse((cost,cur))) = q.pop() {
		for &(nc, ni) in &edge[cur] {
			let next_c = cost + nc;
			if dist[ni] > next_c {
				dist[ni] = next_c;
				q.push(Reverse((next_c,ni)));
			}
		}
	}
	for i in 1..n {
		let mut ans = INF;
		for j in 0..3000_i64 {
			ans = min(ans, dist[calc_id(i,j)]);
		}
		println!("{}", ans);
	}
}

fn run() {
    solve();
}


Measured memory_bytes: 25136