using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using Microsoft.VisualBasic.CompilerServices;

namespace AtCoder
{
	public class Program
	{
		static void Main()
		{
			var cin = new Scanner();
			int n = cin.Int();
			int m = cin.Int();
			int s = cin.Int();

			int max = 2500;
			var to = Helper.Array(n, x => new List<Edge>());
			for (int i = 0; i < m; i++) {
				int u = cin.Int() - 1;
				int v = cin.Int() - 1;
				int a = cin.Int();
				int b = cin.Int();
				to[u].Add(new Edge { To = v, Cost = a, Time = b });
				to[v].Add(new Edge { To = u, Cost = a, Time = b });
			}

			var towns = new (int ginka, long time)[n];
			for (int i = 0; i < n; i++) {
				int c = cin.Int();
				int d = cin.Int();
				towns[i] = (c, d);
			}

			var dist = Helper.Array2(n, max + 1, long.MaxValue);
			dist[0, 0] = 0;

			var pq = new Queue<PriorityPair<long, (int Index, int Ginka)>>(n * max);
			pq.Enqueue(new PriorityPair<long, (int Index, int Ginka)>(0, (0, Math.Min(max, s))));
			while (pq.Count > 0) {
				var cur = pq.Dequeue();
				if (cur.Priority > dist[cur.Item.Index, cur.Item.Ginka]) {
					continue;
				}

				foreach (var next in to[cur.Item.Index]) {
					int ginka = cur.Item.Ginka;
					long offstTime = 0;
					while (ginka <= max) {
						if (next.Cost <= ginka) {
							int nextGinka = ginka - next.Cost;
							long nextTime = cur.Priority + next.Time + offstTime;
							if (dist[next.To, nextGinka] > nextTime) {
								dist[next.To, nextGinka] = nextTime;
								pq.Enqueue(
									new PriorityPair<long, (int Index, int Ginka)>(nextTime, (next.To, nextGinka)));
							}
						}

						ginka += towns[cur.Item.Index].ginka;
						offstTime += towns[cur.Item.Index].time;
					}
				}
			}

			var sb = new StringBuilder();
			for (int i = 1; i < n; i++) {
				long min = long.MaxValue;
				for (int j = 0; j < max; j++) {
					Helper.UpdateMin(ref min, dist[i, j]);
				}
				sb.AppendLine(min.ToString());
			}

			Console.Write(sb.ToString());
		}

		struct Edge
		{
			public int To { get; set; }
			public int Cost { get; set; }
			public long Time { get; set; }
		}

		struct Status
		{
			public int Index { get; set; }
			public int Ginka { get; set; }
			public Status(int index, int ginka)
			{
				Index = index;
				Ginka = ginka;
			}
		}
	}

	public class HashMap<TKey, TValue> : Dictionary<TKey, TValue>
	{
		private readonly TValue default_;
		public HashMap(TValue defaultValue)
			: base()
		{
			default_ = defaultValue;
		}

		public HashMap(TValue defaultValue, int capacity)
			: base(capacity)
		{
			default_ = defaultValue;
		}

		new public TValue this[TKey key]
		{
			get
			{
				if (ContainsKey(key) == false) {
					base[key] = default_;
				}

				return base[key];
			}

			set { base[key] = value; }
		}
	}

	public class PriorityQueue<T>
	{
		private readonly List<T> heap_;
		private readonly Comparison<T> comparison_;
		private readonly bool reverses_;

		public T Top => heap_[0];
		public int Count => heap_.Count;

		public PriorityQueue(bool reverses = false)
			: this(Comparer<T>.Default, reverses) { }

		public PriorityQueue(int capacity, bool reverses = false)
			: this(capacity, Comparer<T>.Default.Compare, reverses) { }

		public PriorityQueue(IComparer<T> comparer, bool reverses = false)
			: this(16, comparer.Compare, reverses) { }

		public PriorityQueue(Comparison<T> comparison, bool reverses = false)
			: this(16, comparison, reverses) { }

		public PriorityQueue(
			int capacity,
			Comparison<T> comparison,
			bool reverses = false)
		{
			heap_ = new List<T>(capacity);
			comparison_ = comparison;
			reverses_ = reverses;
		}

		public void Enqueue(T item)
		{
			int c = heap_.Count;
			heap_.Add(item);
			while (c > 0) {
				int p = (c - 1) >> 1;
				if (Compare(p, c) < 0) {
					Swap(p, c);
				} else {
					break;
				}

				c = p;
			}
		}

		public T Dequeue()
		{
			T ret = heap_[0];
			int n = heap_.Count - 1;

			heap_[0] = heap_[n];
			heap_.RemoveAt(n);
			for (int p = 0, c; (c = (p << 1) + 1) < n; p = c) {
				if (c != n - 1 && Compare(c + 1, c) > 0) {
					++c;
				}

				if (Compare(p, c) < 0) {
					Swap(p, c);
				} else {
					break;
				}
			}

			return ret;
		}

		public void Clear() => heap_.Clear();

		private int Compare(int x, int y)
			=> comparison_(heap_[x], heap_[y]) * (reverses_ ? -1 : 1);

		private void Swap(int x, int y)
		{
			var t = heap_[x];
			heap_[x] = heap_[y];
			heap_[y] = t;
		}
	}

	public struct PriorityPair<T, U> : IComparable<PriorityPair<T, U>>
			where T : IComparable<T>
	{
		public T Priority { get; set; }
		public U Item { get; set; }

		public PriorityPair(T priority, U item)
		{
			Priority = priority;
			Item = item;
		}

		public int CompareTo(PriorityPair<T, U> target)
			=> Priority.CompareTo(target.Priority);

		public override string ToString()
			=> $"{Priority} {Item}";
	}

	public static class Helper
	{
		public static void UpdateMin<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) > 0 ? value : target;

		public static void UpdateMin<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) > 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static void UpdateMax<T>(ref T target, T value) where T : IComparable<T>
			=> target = target.CompareTo(value) < 0 ? value : target;
		public static void UpdateMax<T>(ref T target, T value, Action<T> onUpdated) where T : IComparable<T>
		{
			if (target.CompareTo(value) < 0) {
				target = value;
				onUpdated(value);
			}
		}

		public static T[] Array<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToArray();
		public static List<T> List<T>(int n, Func<int, T> init)
			=> Enumerable.Range(0, n).Select(x => init(x)).ToList();
		public static T[,] Array2<T>(int n, int m, T init)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = init;
				}
			}

			return array;
		}

		public static T[,] Array2<T>(int n, int m, Func<int, int, T> initializer)
		{
			var array = new T[n, m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					array[i, j] = initializer(i, j);
				}
			}

			return array;
		}

		public static T[,,] Array3<T>(int n1, int n2, int n3, T init)
		{
			var array = new T[n1, n2, n3];
			for (int i1 = 0; i1 < n1; i1++) {
				for (int i2 = 0; i2 < n2; i2++) {
					for (int i3 = 0; i3 < n3; i3++) {
						array[i1, i2, i3] = init;
					}
				}
			}

			return array;
		}

		private static readonly int[] delta4_ = { 1, 0, -1, 0, 1 };
		public static void DoAt4(int i, int j, int imax, int jmax, Action<int, int> action)
		{
			for (int n = 0; n < 4; n++) {
				int ii = i + delta4_[n];
				int jj = j + delta4_[n + 1];
				if ((uint)ii < (uint)imax && (uint)jj < (uint)jmax) {
					action(ii, jj);
				}
			}
		}
	}

	public class Scanner
	{
		private readonly string filePath_;
		private readonly Func<string> reader_;
		private string[] buf_;
		private int index_;

		public Scanner(string file = "")
		{
			if (string.IsNullOrWhiteSpace(file)) {
				reader_ = Console.ReadLine;
			} else {
				filePath_ = file;
				var fs = new StreamReader(file);
				reader_ = fs.ReadLine;
			}
			buf_ = new string[0];
			index_ = 0;
		}

		public string Next()
		{
			if (index_ < buf_.Length) {
				return buf_[index_++];
			}

			string st = reader_();
			while (st == "") {
				st = reader_();
			}

			buf_ = st.Split(' ', StringSplitOptions.RemoveEmptyEntries);
			if (buf_.Length == 0) {
				return Next();
			}

			index_ = 0;
			return buf_[index_++];
		}

		public int Int() => int.Parse(Next());
		public long Long() => long.Parse(Next());
		public double Double() => double.Parse(Next());

		public int[] ArrayInt(int N, int add = 0)
		{
			int[] Array = new int[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Int() + add;
			}
			return Array;
		}

		public long[] ArrayLong(int N, long add = 0)
		{
			long[] Array = new long[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Long() + add;
			}
			return Array;
		}

		public double[] ArrayDouble(int N, double add = 0)
		{
			double[] Array = new double[N];
			for (int i = 0; i < N; i++) {
				Array[i] = Double() + add;
			}
			return Array;
		}

		public void Save(string text)
		{
			if (string.IsNullOrWhiteSpace(filePath_)) {
				return;
			}

			File.WriteAllText(filePath_ + "_output.txt", text);
		}
	}
}


Measured memory_bytes: 338792