using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;

// Dijkstra O(|E|log|V|)
class Program
{
    static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        new Program().solve();
        Console.Out.Flush();
    }
    Scanner cin = new Scanner();

    struct Edge : IComparable
    {
        public int to, cost;
        public Edge(int to, int cost)
        {
            this.to = to;
            this.cost = cost;
        }
        public int CompareTo(object obj)
        {
            return cost - ((Edge)obj).cost;
        }
    }


    void solve()
    {
        int V = cin.nextint;
        int E = cin.nextint;
        int r = cin.nextint;

        var G = Enumerable.Range(0, V).Select(i => new List<Edge>()).ToArray();
        var D = Enumerable.Repeat(int.MaxValue, V).ToArray();
        D[r] = 0;


        for (int i = 0; i < E; i++)
        {
            G[cin.nextint].Add(new Edge(cin.nextint, cin.nextint));
        }

        var Q = new PriorityQueue<Edge>();
        Q.Enqueue(new Edge(r, 0));

        while (Q.Any())
        {
            var e = Q.Dequeue();
            var v = e.to;

            if (D[v] < -e.cost) continue;

            foreach (var gv in G[v])
            {
                if (D[gv.to] > D[v] + gv.cost)
                {
                    D[gv.to] = D[v] + gv.cost;
                    Q.Enqueue(new Edge(gv.to, -D[gv.to]));
                }
            }

        }

        foreach (var v in D)
        {
            Console.WriteLine(v == int.MaxValue ? "INF" : v +"");
        }
    }

}

class PriorityQueue<T> where T : IComparable
{
    List<T> heap;
    int size;
    int Compare(T x, T y) { return y.CompareTo(x); }
    public PriorityQueue(){heap = new List<T>();}

    public void Enqueue(T x)
    {
        heap.Add(x);
        int i = size++;

        while (i > 0)
        {
            int p = (i - 1) >> 1;

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

            heap[i] = heap[p];
            i = p;
        }
        heap[i] = x;
    }

    public T Dequeue()
    {
        T ret = heap[0];
        T x = heap[--size];

        int i = 0;
        while ((i << 1) + 1 < size)
        {
            int a = (i << 1) + 1;
            int b = (i << 1) + 2;

            if (b < size && Compare(heap[b], heap[a]) < 0)
                a = b;
            if (Compare(heap[a], x) >= 0)
                break;

            heap[i] = heap[a];
            i = a;
        }
        heap[i] = x;
        heap.RemoveAt(size);
        return ret;
    }

    public int Count { get { return size; } }

    public bool Any() { return size > 0; }

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

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return Console.ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}

Measured memory_bytes: 31268