using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {
    struct Edge {
        public int To, Cost, Time;
    }

    struct Data {
        public int Pos, Money;
        public long TotalTime;
    }

    public void Run() {
        var n = ni();
        var m = ni();
        var s = ni();
        var adj = Enumerable.Range(0, n).Select(_ => new List<Edge>()).ToArray();
        for (int i = 0; i < m; i++) {
            var u = ni() - 1;
            var v = ni() - 1;
            var a = ni();
            var b = ni();
            adj[u].Add(new Edge { To = v, Cost = a, Time = b });
            adj[v].Add(new Edge { To = u, Cost = a, Time = b });
        }
        var c = new int[n];
        var d = new int[n];
        for (int i = 0; i < n; i++) {
            c[i] = ni();
            d[i] = ni();
        }

        var pq = new PriorityQueue<Data>((d1, d2) => d1.TotalTime.CompareTo(d2.TotalTime));
        var maxMoney = 2510;
        pq.Enqueue(new Data { Pos = 0, Money = Math.Min(maxMoney, s), TotalTime = 0 });
        var visited = new bool[n, maxMoney + 10];
        var ans = E.Repeat(long.MaxValue, n).ToArray();
        while (pq.Any()) {
            var current = pq.Dequeue();
            if (current.Money > maxMoney) continue;
            if (visited[current.Pos, current.Money]) continue;
            visited[current.Pos, current.Money] = true;
            //current.Dump();
            ans[current.Pos] = Math.Min(ans[current.Pos], current.TotalTime);

            foreach (var e in adj[current.Pos]) {
                if (current.Money - e.Cost >= 0) {
                    pq.Enqueue(new Data { Pos = e.To, Money = current.Money - e.Cost, TotalTime = current.TotalTime + e.Time });
                }
            }
            pq.Enqueue(new Data { Pos = current.Pos, Money = current.Money + c[current.Pos], TotalTime = current.TotalTime + d[current.Pos] });

        }
        cout.WriteLine(string.Join("\n", ans.Skip(1)));
    }
}

public class PriorityQueue<T> {
    private T[] _array = new T[128];
    private int _size = 0;
    private readonly Comparison<T> _compare;

    public PriorityQueue() {
        _compare = Comparer<T>.Default.Compare;
    }

    public PriorityQueue(Comparison<T> comp) {
        _compare = comp;
    }

    public int Count { get { return _size; } }

    private void Swap(int a, int b) {
        var t = _array[a];
        _array[a] = _array[b];
        _array[b] = t;
    }

    private void Expand() {
        var newlist = new T[_array.Length << 1];
        Array.Copy(_array, newlist, _array.Length);
        _array = newlist;
    }

    public bool Any() {
        return _size > 0;
    }

    public void Enqueue(T newValue) {
        int pos = ++_size;
        if (_size >= _array.Length) {
            Expand();
        }
        _array[pos] = newValue;
        while (pos > 1) {
            int parent = pos >> 1;
            if (_compare(_array[parent], _array[pos]) > 0) {
                Swap(parent, pos);
                pos = parent;
            } else {
                break;
            }
        }
    }

    public T Peek() {
        return _array[1];
    }

    public T Dequeue() {
        var top = _array[1];
        int pos = 1;
        _array[pos] = _array[_size--];
        while ((pos << 1) <= _size) {
            int left = pos << 1;
            int right = left | 1;
            int next = left;
            if (right <= _size && _compare(_array[left], _array[right]) > 0) {
                next = right;
            }
            if (_compare(_array[pos], _array[next]) > 0) {
                Swap(next, pos);
                pos = next;
            } else {
                break;
            }
        }

        return top;
    }
};
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}

Measured memory_bytes: 26600