Language: C

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;

class Solver
{
    public void Solve(Scanner sc)
    {
        int N, M, S;
        sc.Make(out N, out M, out S);
        var g = Create(N, () => new List<E>());
        for (int i = 0; i < M; i++)
        {
            int a, b, c, d;
            sc.Make(out a, out b, out c, out d);
            a--; b--;
            g[a].Add(new E(b, c, d));
            g[b].Add(new E(a, c, d));
        }
        var CD = sc.ArrInt2D(N);
        var dist = Create(N, () => Create(3000, () => long.MaxValue / 2));
        var pq = new PriorityQueue<P>((a, b) => a.cost.CompareTo(b.cost));
        pq.Push(new P(0, 0, Min(S, 2525)));
        dist[0][Min(S, 2525)] = 0;
        while (pq.Any())
        {
            var p = pq.Pop();
            if (dist[p.to][p.si] < p.cost) continue;
            int c = Min(2525, p.si + CD[p.to][0]);
            if(chmin(ref dist[p.to][c], p.cost + CD[p.to][1]))
            {
                pq.Push(new P(p.to, dist[p.to][c], c));
            }
            foreach (var e in g[p.to])
            {
                if (e.need > p.si) continue;
                if (chmin(ref dist[e.to][p.si - e.need], p.cost + e.cost))
                {
                    pq.Push(new P(e.to, dist[e.to][p.si - e.need], p.si - e.need));
                }
            }
        }
        for (int i = 1; i < N; i++)
        {
            WriteLine(dist[i].Min());
        }
    }
    struct E
    {
        public int to, need, cost;
        public E(int t, int n, int c)
        {
            to = t; need = n; cost = c;
        }
    }
    struct P
    {
        public int to, si; public long cost;
        public P(int t, long c, int s)
        {
            to = t; cost = c; si = s;
        }
    }
}

public class PriorityQueue<T>
{
    private List<T> data = new List<T>();
    private Comparison<T> cmp;
    public int Count { get { return data.Count; } }
    public T Top { get { return data[0]; } }
    public PriorityQueue() { cmp = cmp ?? Comparer<T>.Default.Compare; }

    public PriorityQueue(Comparison<T> comparison) { cmp = comparison; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private int Parent(int i)
        => (i - 1) >> 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private int Left(int i)
        => (i << 1) + 1;
    public T Push(T val)
    {
        int i = data.Count;
        data.Add(val);
        while (i > 0)
        {
            int p = Parent(i);
            if (cmp(data[p], val) <= 0)
                break;
            data[i] = data[p];
            i = p;
        }
        data[i] = val;
        return val;
    }
    public T Pop()
    {
        var ret = data[0];
        var p = 0;
        var x = data[data.Count - 1];
        while (Left(p) < data.Count - 1)
        {
            var l = Left(p);
            if (l < data.Count - 2 && cmp(data[l + 1], data[l]) < 0) l++;
            if (cmp(data[l], x) >= 0)
                break;
            data[p] = data[l];
            p = l;
        }
        data[p] = x;
        data.RemoveAt(data.Count - 1);
        return ret;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public bool Any() => data.Count > 0;
}

#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion


Compiler output:
main.c:1:1: error: unknown type name 'using'
    1 | using System;
      | ^~~~~
main.c:2:1: error: unknown type name 'using'
    2 | using System.Collections.Generic;
      | ^~~~~
main.c:2:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    2 | using System.Collections.Generic;
      |             ^
main.c:3:1: error: unknown type name 'using'
    3 | using System.Linq;
      | ^~~~~
main.c:3:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    3 | using System.Linq;
      |             ^
main.c:4:1: error: unknown type name 'using'
    4 | using System.IO;
      | ^~~~~
main.c:4:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    4 | using System.IO;
      |             ^
main.c:5:1: error: unknown type name 'using'
    5 | using System.Runtime.CompilerServices;
      | ^~~~~
main.c:5:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    5 | using System.Runtime.CompilerServices;
      |             ^
main.c:6:1: error: unknown type name 'using'
    6 | using System.Text;
      | ^~~~~
main.c:6:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    6 | using System.Text;
      |             ^
main.c:7:1: error: unknown type name 'using'
    7 | using System.Diagnostics;
      | ^~~~~
main.c:7:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    7 | using System.Diagnostics;
      |             ^
main.c:8:1: error: unknown type name 'using'
    8 | using System.Numerics;
      | ^~~~~
main.c:8:13: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    8 | using System.Numerics;
      |             ^
main.c:9:6: error: expected ';' before 'static'
    9 | using static System.Console;
      |      ^~~~~~~
      |      ;
main.c:9:20: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    9 | using static System.Console;
      |                    ^
main.c:10:6: error: expected ';' before 'static'
   10 | using static System.Convert;
      |      ^~~~~~~
      |      ;
main.c:10:20: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
   10 | using static System.Convert;
      |                    ^
main.c:11:6: error: expected ';' before 'static'
   11 | using static System.Math;
      |      ^~~~~~~
      |      ;
main.c:11:20: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
   11 | using static System.Math;
      |                    ^
main.c:12:6: error: expected ';' before 'static'
   12 | using static Template;
      |      ^~~~~~~
      |      ;
main.c:12:14: error: type defaults to 'int' in declaration of 'Template' [-Wimplicit-int]
   12 | using static Template;
      |              ^~~~~~~~
main.c:13:1: error: unknown type name 'using'
   13 | using Pi = Pair<int, int>;
      | ^~~~~
main.c:13:12: error: 'Pair' undeclared here (not in a function); did you mean 'Pi'?
   13 | using Pi = Pair<int, int>;
      |            ^~~~
      |            Pi
main.c:13:17: error: expected expression before 'int'
   13 | using Pi = Pair<int, int>;
      |                 ^~~
main.c:15:1: error: unknown type name 'class'
   15 | class Solver
      | ^~~~~
main.c:16:1: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
   16 | {
      | ^
main.c:76:1: error: unknown type name 'public'
   76 | public class PriorityQueue<T>
      | ^~~~~~
main.c:76:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'PriorityQueue'
   76 | public class PriorityQueue<T>
      |              ^~~~~~~~~~~~~
main.c:129:2: error: invalid preprocessing directive #region
  129 | #region Template
      |  ^~~~~~
main.c:130:7: error: expected ';' before 'static'
  130 | public static class Template
      |       ^~~~~~~
      |       ;
main.c:130:15: error: unknown type name 'class'
  130 | public static class Template
      |               ^~~~~
main.c:131:1: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
  131 | {
      | ^
main.c:154:1: error: unknown type name 'public'
  154 | public class Scanner
      | ^~~~~~
main.c:154:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Scanner'
  154 | public class Scanner
      |              ^~~~~~~
main.c:180:1: error: unknown type name 'public'
  180 | public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
      | ^~~~~~
main.c:180:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Pair'
  180 | public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
      |              ^~~~
main.c:200:1: error: unknown type name 'public'
  200 | public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
      | ^~~~~~
main.c:200:14: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'Pair'
  200 | public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
      |              ^~~~
main.c:218:2: error: invalid preprocessing directive #endregion
  218 | #endregion
      |  ^~~~~~~~~