using static System.Math;
using System.Collections.Generic;
using System;

public class PriorityQueue<T> where T : IComparable
{
    private IComparer<T> _comparer = null;
    private int _type = 0;
    private T[] _heap;
    private int _sz = 0;
    private int _count = 0;
    /// <summary>
    /// Priority Queue with custom comparer
    /// </summary>
    public PriorityQueue(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }

    /// <summary>
    /// Priority queue
    /// </summary>
    /// <param name="maxSize">max size</param>
    /// <param name="type">0: asc, 1:desc</param>
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _type = type;
    }
    private int Compare(T x, T y)
    {
        if (_comparer != null) return _comparer.Compare(x, y);
        return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
    }
    public void Push(T x)
    {
        _count++;
        var i = _sz++;
        while (i > 0)
        {
            var p = (i - 1) / 2;

            if (Compare(_heap[p], x) <= 0) break;

            _heap[i] = _heap[p];
            i = p;
        }
        _heap[i] = x;
    }
    public T Pop()
    {
        _count--;
        T ret = _heap[0];
        T x = _heap[--_sz];

        int i = 0;
        while (i * 2 + 1 < _sz)
        {
            //children
            int a = i * 2 + 1;
            int b = i * 2 + 2;

            if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

            if (Compare(_heap[a], x) >= 0) break;

            _heap[i] = _heap[a];
            i = a;
        }
        _heap[i] = x;
        return ret;
    }
    public int Count()
    {
        return _count;
    }
    public T Peek()
    {
        return _heap[0];
    }
    public bool Contains(T x)
    {
        for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
        return false;
    }
    public void Clear()
    {
        while (this.Count() > 0) this.Pop();
    }
    public IEnumerator<T> GetEnumerator()
    {
        var ret = new List<T>();
        while (this.Count() > 0)
        {
            ret.Add(this.Pop());
        }
        foreach (var r in ret)
        {
            this.Push(r);
            yield return r;
        }
    }
    public T[] ToArray()
    {
        T[] array = new T[_sz];
        int i = 0;
        foreach (var r in this)
        {
            array[i++] = r;
        }
        return array;
    }
}
public class Edge
{
    public int to1 { get; set; }
    public int to2 { get; set; }
    public long d { get; set; }
}
public class Node : IComparable
{
    public int id1 { get; set; }
    public int id2 { get; set; }
    public long d { get; set; }
    public int CompareTo(object obj)
    {
        var x = (Node)obj;
        if (this.d > x.d) return 1;
        else if (this.d == x.d) return 0;
        else return -1;
    }
}

public class Hello
{
    public static long BIG = 10000000000000;
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var n = int.Parse(line[0]);
        var pq = new PriorityQueue<Node>(n + 100000, 0);
        var m = int.Parse(line[1]);
        var r = int.Parse(line[2]);
        var te = new int[m, 4];
        var smax = 0;
        for (int i = 0; i < m; i++)
        {
            line = Console.ReadLine().Trim().Split(' ');
            for (int j = 0; j < 4; j++)
            {
                te[i, j] = int.Parse(line[j]);
                if (j == 2) smax += te[i, j];
            }
        }
        r = Min(smax, r);
        var a = new List<Edge>[n, smax + 1];
        for (int i = 0; i < n; i++)
            for (int j = 0; j <= smax; j++)
                a[i, j] = new List<Edge>();
        for (int i = 0; i < m; i++)
        {
            var u = te[i, 0] - 1;
            var u2 = te[i, 1] - 1;
            var g = te[i, 2];
            var d = (long)te[i, 3];
            for (int j = 0; j <= smax; j++)
            {
                if (j - g >= 0)
                {
                    a[u, j].Add(new Edge { to1 = u2, to2 = j - g, d = d });
                    a[u2, j].Add(new Edge { to1 = u, to2 = j - g, d = d });
                }
            }
        }
        for (int i = 0; i < n; i++)
        {
            line = Console.ReadLine().Trim().Split(' ');
            var c1 = int.Parse(line[0]);
            var c2 = int.Parse(line[1]);
            for (int j = 0; j <= smax; j++)
            {
                a[i, j].Add(new Edge { to1 = i, to2 = Min(smax, j + c1), d = c2 });
            }
        }
        var mind = new long[n, smax + 1];
        for (int i = 0; i < n; i++)
            for (int j = 0; j <= smax; j++) mind[i, j] = BIG;
        goDijk(pq, a, 0, r, n, mind);
        print(n, smax, mind);
    }
    static void print(int n, int smax, long[,] mind)
    {
        var ans = new long[n - 1];
        for (int i = 1; i < n; i++)
        {
            var tmin = BIG;
            for (int j = 0; j < smax; j++)
                tmin = Min(tmin, mind[i, j]);
            ans[i - 1] = tmin;
        }
        Console.WriteLine(string.Join("\n", ans));
    }
    public static void goDijk(PriorityQueue<Node> pq, List<Edge>[,] aa, int r, int r1, int n, long[,] mind)
    {
        pq.Push(new Node { id1 = r, id2 = r1, d = 0 });
        while (pq.Count() > 0)
        {
            var targ = pq.Pop();
            var nowd = targ.d;
            var nowid1 = targ.id1;
            var nowid2 = targ.id2;
            if (mind[nowid1, nowid2] < nowd) continue;
            mind[nowid1, nowid2] = nowd;
            foreach (var x in aa[nowid1, nowid2])
                if (nowd + x.d < mind[x.to1, x.to2])
                {
                    mind[x.to1, x.to2] = nowd + x.d;
                    pq.Push(new Node { id1 = x.to1, id2 = x.to2, d = nowd + x.d });
                }
        }
    }
}


Measured memory_bytes: 69932