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

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            ABC164.E();
        }
        class ABC164
        {
            public static void A()
            {
                var S = Read.Int();
                var W = Read.Int();
                Console.WriteLine(S>W?"safe":"unsafe");
            }
            public static void B()
            {
                var A = Read.Int();
                var B = Read.Int();
                var C = Read.Int();
                var D = Read.Int();
                while (true)
                {
                    C -= B; if (C <= 0) { Console.WriteLine("Yes"); return; }
                    A -= D; if (A <= 0) { Console.WriteLine("No"); return; }
                }
            }
            public static void C()
            {
                var N = Read.Int();
                var hash = new HashSet<string>();
                for(int i = 0; i < N; ++i)
                {
                    var s = Read.Str();
                    if (!hash.Contains(s)) { hash.Add(s); }
                }
                Console.WriteLine(hash.Count);
            }
            public static void D()
            {
                var S = Read.Str();
                var N = S.Length;
                var mod = new int[N + 1];
                var p10 = 1;
                for(int i = 0; i < N; ++i)
                {
                    //mod[i + 1] = (mod[i] * 10 + (S[i] - '0')) % 2019;
                    mod[i + 1] = (mod[i] + p10 * (S[N - 1 - i] - '0')) % 2019;
                    p10 = (p10 * 10) % 2019;
                }
                var freq = Util.Frequency(mod);
                long count = 0;
                foreach(var kvp in freq)
                {
                    count += kvp.Value * (kvp.Value - 1) / 2;
                }
                Console.WriteLine(count);
            }
            public static void E()
            {
                var N = Read.Int();
                var M = Read.Int();
                var S = Read.Long();
                var Edge = Enumerable.Range(0, M).Select(i => Read.LongN()).ToArray();
                var Adj = new Dictionary<int, Dictionary<int, Tuple<long, long>>>();
                for(int i = 1; i <= N; ++i) { Adj.Add(i, new Dictionary<int, Tuple<long, long>>()); }
                foreach(var e in Edge)
                {
                    var u = (int)e[0];
                    var v = (int)e[1];
                    var a = e[2];
                    var b = e[3];
                    Adj[u].Add(v, new Tuple<long, long>(a, b));
                    Adj[v].Add(u, new Tuple<long, long>(a, b));
                }
                var CD = Read.TupleLong(N);

                var dp = new long[N + 1, 5001];
                for (int i = 1; i <= N; ++i)
                {
                    for (int j = 0; j <= 5000; ++j)
                    {
                        dp[i, j] = (long)1e18;
                    }
                }
                for (int c = 0; ; ++c)
                {
                    var s = Math.Min(5000, S) + CD[0].Item1 * c;
                    if (s > 5000) { break; }
                    dp[1, s] = CD[0].Item2 * c;
                }
                Queue<int> queue = new Queue<int>();
                queue.Enqueue(1);
                while (queue.Count > 0)
                {
                    var v = queue.Dequeue();
                    foreach (var kvp in Adj[v])
                    {
                        bool ok = false;
                        var w = kvp.Key;
                        var a = kvp.Value.Item1;
                        var b = kvp.Value.Item2;
                        for(int i = (int)a; i <= 5000; ++i)
                        {
                            if(dp[w, i-a] > dp[v,i] + b)
                            {
                                ok = true;
                                dp[w, i - a] = dp[v, i] + b;
                            }
                        }
                        for(int i = 0; i <= 5000; ++i)
                        {
                            var s = i + CD[w - 1].Item1;
                            if (s > 5000) { break; }
                            dp[w, s] = Math.Min(dp[w, s], dp[w, i] + CD[w - 1].Item2);
                        }
                        if (ok)
                        {
                            queue.Enqueue(w);
                        }
                    }
                }
                for(int i = 2; i <= N; ++i)
                {
                    var min = (long)1e18;
                    for(int j = 0; j <= 5000; ++j)
                    {
                        min = Math.Min(min, dp[i, j]);
                    }
                    Console.WriteLine(min);
                }
            }
            public static void F()
            {

            }
        }
        class Util
        {
            public static readonly long P = 1000000007;
            public static long Power(long a, long n, long p)
            {
                long res = 1;
                long mult = a;
                for (int i = 0; i < 40; ++i)
                {
                    if ((n & ((long)1 << i)) > 0)
                    {
                        res = (res * mult) % p;
                    }
                    mult = (mult * mult) % p;
                }
                return res;
            }
            public static long Inverse(long a, long p)
            {
                long b = p, c = 1, d = 0, e = 0, f = 0;
                while (b != 0)
                {
                    e = a / b;
                    f = b; b = a - e * b; a = f;
                    f = d; d = c - e * d; c = f;
                }
                c %= p;
                return c + (c < 0 ? p : 0);
            }

            public static long[] Facts(int n, long p)
            {
                var facts = new long[n + 1];
                facts[0] = 1;
                for (int i = 1; i <= n; ++i)
                {
                    facts[i] = (i * facts[i - 1]) % p;
                }
                return facts;
            }
            public static Func<int, int, long> Combin(int n, long P)
            {
                var fact = Facts(n, P);
                var inv = fact.Select(x => Inverse(x, P)).ToArray();
                return (N, M) =>
                {
                    if (N < 0 || N < M || M < 0) { return 0; }
                    return (((fact[N] * inv[M]) % P) * inv[N - M]) % P;
                };
            }
            public static Dictionary<T, long> Frequency<T>(T[] array)
            {
                var dict = new Dictionary<T, long>();
                foreach (var a in array)
                {
                    if (!dict.ContainsKey(a)) { dict.Add(a, 0); }
                    dict[a]++;
                }
                return dict;
            }
            public static long[] ASum(long[] array)
            {
                var res = new long[array.Length + 1];
                for (int i = 0; i < array.Length; ++i)
                {
                    res[i + 1] = res[i] + array[i];
                }
                return res;
            }
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M, bool isDirectional = false)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i) { dict.Add(i, new HashSet<int>()); }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN(); dict[ab[0]].Add(ab[1]);
                    if (!isDirectional) { dict[ab[1]].Add(ab[0]); }
                }
                return dict;
            }
            public static Dictionary<int, Dictionary<int, long>> AdjacencyListWithWeight(int N, int M)
            {
                Dictionary<int, Dictionary<int, long>> dict = new Dictionary<int, Dictionary<int, long>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new Dictionary<int, long>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1], ab[2]);
                    dict[ab[1]].Add(ab[0], ab[2]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 21160