using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
using static System.Math;
using static System.Array;
using static AtCoder.IO_ShortCut;
using static AtCoder.Tool;
using static AtCoder.ModInt;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        //const int MOD = 998244353;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };
        static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };
        //static List<List<int>> G = new List<List<int>>();
        static List<List<Edge>> G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();
        static void Main(string[] args)
        {
            var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };Console.SetOut(sw);
            Solve();
            Console.Out.Flush();
        }
        static void Solve()
        {
            int N, M;long S;
            Input(out N, out M, out S);

            for (var i = 0; i < N; i++) G.Add(new List<Edge>());
            for(var i = 0; i < M; i++)
            {
                int u, v;
                long A, B;
                Input(out u, out v, out A, out B);
                u--;v--;
                G[u].Add(new Edge(v, B, A));
                G[v].Add(new Edge(u, B, A));
            }
            var C = new long[N];
            var D = new long[N];
            for (var i = 0; i < N; i++) Input(out C[i], out D[i]);
            long MX = 50 * 50;
            S = Min(S, MX);
            long[,] Dijkstra()
            {
                var dp = new long[N, MX + 1];
                for (var i = 0; i < N; i++) for (var j = 0; j <= MX; j++) dp[i, j] = SINF;
                var V = new Priority_Queue<Tuple<int, long, long>>((a, b) => (Sig(a.Item3 - b.Item3)));
                V.Enqueue(new Tuple<int, long, long>(0, S, 0));
                while (V.Any())
                {
                    var t = V.Dequeue();
                    int v = t.Item1;
                    var K = t.Item2;
                    if (dp[v, K] != SINF) continue;
                    dp[v, K] = t.Item3;

                    //補充
                    long ad = Min(MX, K + C[v]);
                    if (dp[v, ad] > dp[v, K] + D[v])
                    {
                        V.Enqueue(new Tuple<int, long, long>(v, ad, dp[v, K] + D[v]));
                    }
                    //移動
                    foreach(var ed in G[v])
                    {
                        int nx = ed.to;
                        if (K < ed.fare) continue;
                        if (dp[nx, K - ed.fare] > dp[v, K] + ed.dist)
                        {
                            V.Enqueue(new Tuple<int, long, long>(nx, K - ed.fare, dp[v, K] + ed.dist));
                        }
                    }
                }
                return dp;
            }
            var ans = Dijkstra();
            for(var i = 1; i < N; i++)
            {
                long mn = SINF;
                for (var j = 0; j <= MX; j++) mn = Min(mn, ans[i, j]);
                OutL(mn);
            }
            
        }
        
        public class Priority_Queue<T>
        {
            private List<T> Q;
            private readonly Comparison<T> Func_Compare;
            public Priority_Queue(Comparison<T> comp)
            {
                Func_Compare = comp;
                Q = new List<T>();
            }
            private void PushHeap(List<T> list, T item)
            {
                int n = list.Count();
                list.Add(item);

                while (n != 0)
                {
                    int pIndex = (n - 1) / 2;

                    if (Func_Compare(list[n], list[pIndex]) < 0)
                    {
                        Swap(Q, n, pIndex);
                    }
                    else { break; }

                    n = pIndex;
                }
            }
            private void PopHeap(List<T> list)
            {
                int n = list.Count() - 1;
                list[0] = list[n];
                list.RemoveAt(n);

                int cur = 0;
                int comp;

                while (2 * cur + 1 <= n - 1)
                {
                    int c1 = 2 * cur + 1;
                    int c2 = 2 * (cur + 1);
                    if (c1 == n - 1)
                    {
                        comp = c1;
                    }
                    else
                    {

                        comp = Func_Compare(list[c1], list[c2]) < 0 ? c1 : c2;
                    }

                    if (Func_Compare(list[cur], list[comp]) > 0)
                    {
                        Swap(Q, cur, comp);
                    }
                    else { break; }

                    cur = comp;
                }
            }
            private void Swap(List<T> list, int a, int b)
            {
                T keep = list[a];
                list[a] = list[b];
                list[b] = keep;
            }

            public void Enqueue(T value)
            {
                PushHeap(Q, value);
            }

            public T Dequeue()
            {
                T ret = Q[0];
                PopHeap(Q);
                return ret;
            }

            public T Peek()
            {
                return Q[0];
            }

            public int Count()
            {
                return Q.Count();
            }
            public bool Any()
            {
                return Q.Any();
            }
        }
        public struct Edge
        {
            public int from;

            public int to;
            public long dist;

            public long fare;
            public Edge(int to,long d,long money)
            {
                from = -1;
                this.to = to;
                dist = d;
                fare = money;
            }
            /*public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }*/
        }
    }
    public class Priority_Queue<T>
    {
        private List<T> Q;
        private readonly Comparison<T> Func_Compare;
        public Priority_Queue(Comparison<T> comp)
        {
            Func_Compare = comp;
            Q = new List<T>();
        }
        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (Func_Compare(list[n], list[pIndex]) < 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }
        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {

                    comp = Func_Compare(list[c1], list[c2]) < 0 ? c1 : c2;
                }

                if (Func_Compare(list[cur], list[comp]) > 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }
        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }

        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int Count()
        {
            return Q.Count();
        }
        public bool Any()
        {
            return Q.Any();
        }
    }
    struct ModInt
    {
        public long value;
        private const int MOD = 1000000007;
        //private const int MOD = 998244353;

        public ModInt(long value) { this.value = value; }
        public static implicit operator ModInt(long a)
        {
            var ret = a % MOD;
            return new ModInt(ret < 0 ? (ret + MOD) : ret);
        }
        public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);
        public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);
        public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);
        public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);
        public static ModInt operator <<(ModInt a, int n) => (a.value << n);
        public static ModInt operator >>(ModInt a, int n) => (a.value >> n);
        public static ModInt operator ++(ModInt a) => a.value + 1;
        public static ModInt operator --(ModInt a) => a.value - 1;
        public static ModInt Modpow(ModInt a, long n)
        {
            var k = a;
            ModInt ret = 1;
            while (n > 0)
            {
                if ((n & 1) != 0) ret *= k;
                k *= k;
                n >>= 1;
            }
            return ret;
        }
        private static readonly List<long> Factorials = new List<long>() { 1 };
        public static ModInt Fac(long n)
        {
            for (var i = Factorials.Count(); i <= n; i++)
            {
                Factorials.Add((Factorials[i - 1] * i) % MOD);
            }
            return Factorials[(int)n];
        }
        public static ModInt nCr(long n, long r)
        {
            return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));
        }
        public static explicit operator int(ModInt a) => (int)a.value;
    }
    static class IO_ShortCut
    {
        public static string[] _ReadSplit => Console.ReadLine().Split();
        public static int[] _ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);
        public static long[] _ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);
        public static double[] _ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);
        public static string Str => Console.ReadLine();
        public static int Int => int.Parse(Console.ReadLine());
        public static long Long => long.Parse(Console.ReadLine());
        public static double Double => double.Parse(Console.ReadLine());
        public static T Conv<T>(string input)
        {
            if (typeof(T).Equals(typeof(ModInt)))
            {
                return (T)(dynamic)(long.Parse(input));
            }
            return (T)Convert.ChangeType(input, typeof(T));
        }
        public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());
        public static void Input<T, U>(out T a, out U b)
        { var q = _ReadSplit;a = Conv<T>(q[0]);b = Conv<U>(q[1]); }
        public static void Input<T, U, V>(out T a, out U b, out V c)
        { var q = _ReadSplit;a = Conv<T>(q[0]);b = Conv<U>(q[1]);c = Conv<V>(q[2]); }
        public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d)
        { var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]);d = Conv<W>(q[3]); }

        public static void OutL(object s) => Console.WriteLine(s);
        public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));
        public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));
        public static void Out_One(object s) => Console.Write($"{s} ");
        public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");
        public static void Endl() => Console.WriteLine();
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            array = ConvertAll(array, x => initialvalue);
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }
        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }
        static public long LPow(int a, int b) => (long)Pow(a, b);
        static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;
        static public int Sig(long a) => a == 0 ? 0 : (int)(a / Abs(a));
    }
}

Measured memory_bytes: 39436