using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        Solve();
        Console.Out.Flush();
    }


    static void Solve()
    {
        var N = sc.ReadInt();
        var M = sc.ReadInt();
        var S = Math.Min(2500, sc.ReadInt());
        var G = new List<(int, int, long)>[N];
        for (int i = 0; i < N; i++)
        {
            G[i] = new List<(int, int, long)>();
        }
        for (int i = 0; i < M; i++)
        {
            var u = sc.ReadInt() - 1;
            var v = sc.ReadInt() - 1;
            var a = sc.ReadInt();
            var b = sc.ReadLong();
            G[u].Add((v, a, b));
            G[v].Add((u, a, b));
        }
        var C = new long[N];
        var D = new long[N];
        for (int i = 0; i < N; i++)
        {
            C[i] = sc.ReadLong();
            D[i] = sc.ReadLong();
        }

        // 元の頂点N*2501の新しい頂点のグラフを考える
        var dij = new Dijkstra(N * 2501);
        
        // 元の頂点番号と所持金から新しい頂点番号を取得する関数
        static int newV(int n, int s) => 2501 * n + s;

        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j <= 2500; j++)
            {
                // 移動する
                foreach (var e in G[i])
                {
                    var next = e.Item1;
                    var cost = e.Item2; // a
                    var time = e.Item3; // b
                    if (j - cost >= 0)
                    {
                        // 所持金が足りている場合のみ移動可能
                        var nowv = newV(i, j);
                        var nextv = newV(next, j - cost);
                        dij.Add(nowv, nextv, time);
                    }
                }
                {
                    // 金貨を交換する
                    var s = (int)Math.Min(2500, j + C[i]);
                    var nowv = newV(i, j);
                    var nextv = newV(i, s);
                    dij.Add(nowv, nextv, D[i]);
                }
            }
        }

        // 開始位置からの最短経路をダイクストラで求める
        var start = newV(0, S);
        var dist = dij.Calc(start);
        // 元の頂点番号に到達する最短経路を計算する
        for (int i = 1; i < N; i++)
        {
            var ans = long.MaxValue;
            for (int j = 0; j <= 2500; j++)
            {
                var index = newV(i, j);
                ans = Math.Min(ans, dist[index]);
            }
            Console.WriteLine(ans);
        }
    }
    class Dijkstra
    {
        public const long INF = long.MaxValue / 2;
        public int V { get; set; }
        public int E { get; set; }
        public List<Edge>[] G { get; set; }
        public Dijkstra(int n)
        {
            this.V = n;
            this.G = new List<Edge>[V];
            for (int i = 0; i < V; i++)
            {
                this.G[i] = new List<Edge>();
            }
        }
        public void Add(int a, int b, long cost = 1)
        {
            this.G[a].Add(new Edge(b, cost));
            this.E++;
        }
        public long GetMinCost(int start, int goal)
        {
            var cost = new long[V];
            for (int i = 0; i < V; i++) cost[i] = INF;
            cost[start] = 0;

            var capacity = Math.Max(1, E);
            var q = new PriorityQueue<P>(capacity, false);
            q.Enqueue(new P(start, 0));

            while (q.Count > 0)
            {
                var p = q.Dequeue();
                if (p.Cost != cost[p.A]) continue;
                foreach (var e in this.G[p.A])
                {
                    if (cost[e.To] > p.Cost + e.Cost)
                    {
                        cost[e.To] = p.Cost + e.Cost;
                        q.Enqueue(new P(e.To, cost[e.To]));
                    }
                }
            }
            return cost[goal] == long.MaxValue ? -1 : cost[goal];
        }
        public long[] Calc(int start)
        {
            var visited = new bool[V];
            var cost = new long[V];
            for (int i = 0; i < V; i++) cost[i] = INF;
            cost[start] = 0;

            var capacity = Math.Max(1, E);
            var q = new PriorityQueue<P>(capacity, false);
            q.Enqueue(new P(start, 0));

            while (q.Count > 0)
            {
                var p = q.Dequeue();
                visited[p.A] = true;
                if (p.Cost != cost[p.A]) continue;
                foreach (var e in this.G[p.A])
                {
                    if (cost[e.To] > p.Cost + e.Cost && !visited[e.To])
                    {
                        cost[e.To] = p.Cost + e.Cost;
                        q.Enqueue(new P(e.To, cost[e.To]));
                    }
                }
            }
            return cost;
        }
        public struct Edge
        {
            public int To;
            public long Cost;
            public Edge(int to, long cost)
            {
                this.To = to;
                this.Cost = cost;
            }
        }
        public struct P : IComparable<P>
        {
            public int A;
            public long Cost;
            public P(int a, long cost)
            {
                this.A = a;
                this.Cost = cost;
            }
            public int CompareTo(P other)
            {
                return this.Cost.CompareTo(other.Cost);
            }
        }
        class PriorityQueue<T>
        {
            public readonly T[] Array;
            public readonly bool Greater;
            public int Count { get; private set; } = 0;
            private IComparer<T> Cmp;
            public PriorityQueue(int capacity, bool greater = true, IComparer<T> cmp = null)
            {
                this.Cmp = cmp;
                if (cmp == null)
                {
                    this.Cmp = Comparer<T>.Default;
                }
                this.Array = new T[capacity];
                this.Greater = greater;
            }
            public void Enqueue(T item)
            {
                this.Array[this.Count] = item;
                this.Count += 1;
                this.UpHeap();
            }
            public T Dequeue()
            {
                this.Swap(0, this.Count - 1);
                this.Count -= 1;
                this.DownHeap();

                return this.Array[this.Count];
            }
            public T Peek()
            {
                return this.Array[0];
            }
            private void UpHeap()
            {
                var n = this.Count - 1;
                while (n != 0)
                {
                    var parent = (n - 1) / 2;

                    if (this.Compare(this.Array[n], this.Array[parent]) > 0)
                    {
                        this.Swap(n, parent);
                        n = parent;
                    }
                    else
                    {
                        break;
                    }
                }
            }
            private void DownHeap()
            {
                var parent = 0;
                while (true)
                {
                    var child = 2 * parent + 1;
                    if (child > this.Count - 1) break;

                    if (child < this.Count - 1 && this.Compare(this.Array[child], this.Array[child + 1]) < 0)
                    {
                        child += 1;
                    }
                    if (this.Compare(this.Array[parent], this.Array[child]) < 0)
                    {
                        this.Swap(parent, child);
                        parent = child;
                    }
                    else
                    {
                        break;
                    }
                }
            }
            private int Compare(T a, T b)
            {
                var c = this.Cmp.Compare(a, b);
                if (!this.Greater)
                {
                    c = -c;
                }
                return c;
            }
            private void Swap(int a, int b)
            {
                var tmp = this.Array[a];
                this.Array[a] = this.Array[b];
                this.Array[b] = tmp;
            }
        }
    }
    static Scanner sc = new Scanner();
}
class Scanner
{
    string[] S = new string[0];
    int Index = 0;
    char[] Separators = new char[] { ' ' };

    public string Next()
    {
        if (this.Index < this.S.Length) return this.S[this.Index++];
        var line = "";
        while (line == "") line = Console.ReadLine();
        this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);
        if (this.S.Length == 0) return this.Next();
        this.Index = 0;
        return this.S[this.Index++];
    }
    public string ReadStr()
    {
        return this.Next();
    }
    public char ReadChar()
    {
        return this.Next()[0];
    }
    public int ReadInt()
    {
        return int.Parse(this.Next());
    }
    public uint ReadUInt()
    {
        return uint.Parse(this.Next());
    }
    public long ReadLong()
    {
        return long.Parse(this.Next());
    }
    public double ReadDouble()
    {
        return double.Parse(this.Next());
    }
    public Tuple<int, int> ReadTup(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<long, long> ReadTupLong(int add = 0)
    {
        return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add);
    }
    public Tuple<int, int, int> ReadTup3(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<int, int, int, int> ReadTup4(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public int[] ReadIntArray(int n)
    {
        var array = new int[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadInt();
        }
        return array;
    }
    public long[] ReadLongArray(int n)
    {
        var array = new long[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadLong();
        }
        return array;
    }
    public double[] ReadDoubleArray(int n)
    {
        var array = new double[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadDouble();
        }
        return array;
    }
    public char[] ReadCharArray(int n)
    {
        var array = new char[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadChar();
        }
        return array;
    }
    public string[] ReadStrArray(int n)
    {
        var array = new string[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadStr();
        }
        return array;
    }
    public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0)
    {
        var array = new Tuple<long, long>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTupLong(add);
        }
        return array;
    }
    public Tuple<int, int>[] ReadTupArray(int n, int add = 0)
    {
        var array = new Tuple<int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup(add);
        }
        return array;
    }
    public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup3(add);
        }
        return array;
    }
    public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup4(add);
        }
        return array;
    }
}


Measured memory_bytes: 59480