output_description: Print the costs of SSSP in the following format.
  
      
      
      c0
      c1
      :
      c|V|-1
      
  
  The output consists of |V| lines. Print the cost of the shortest path from the
  source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the
  source to a vertex, print INF.
input_description: An edge-weighted graph G (V, E) and the source r.
  
      
      
      |V| |E| r
      s0 t0 d0
      s1 t1 d1
      :
      s|E|-1 t|E|-1 d|E|-1
      
  
  |V| is the number of vertices and |E| is the number of edges in G. The graph
  vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the
  source of the graph.
  
  si and ti represent source and target vertices of i-th edge (directed) and di
  represents the cost of the i-th edge.
attempt: import sys
  
  readline = sys.stdin.buffer.readline
  
  
  def even(n):
      return 1 if n % 2 == 0 else 0
  
  
  n, m, r = map(int, readline().split())
  g = [[] for i in range(n)]
  for i in range(m):
      x, y, w = map(int, readline().split())
      g[x].append((w, y))
      # g[y].append((w,x))
  
  # 新ダイクストラ
  INF = 10**18
  import heapq
  
  push = heapq.heappush
  pop = heapq.heappop
  
  
  def dijkstra(s, g):  # g:(weight,go)の順の隣接リスト※タプルで有ることに注意
      n = len(g)
      dist = [INF] * n
      dist[s] = 0
      used = [0] * n
      used[s] = 1
      hp = []
      for go in g[s]:
          push(hp, go)
      while hp:
          w, fr = pop(hp)
  
          if not used[fr]:
              dist[fr] = w
              used[fr] = 1
              for w, go in g[fr]:
                  if not used[go]:
                      push(hp, (w + dist[fr], go))
  
      return dist
  
  
  for i in dijkstra(r, g):
      print(i if i < INF else "INF")
  
problem_description: Single Source Shortest Path
  
  For a given weighted graph G(V, E) and a source r, find the source shortest
  path to each vertex from the source (SSSP: Single Source Shortest Path).
samples: [{"input": "4 5 0\n    0 1 1\n    0 2 4\n    1 2 2\n    2 3 1\n    1 3 5", "output": "0\n    1\n    3\n    4"}, {"input": "4 6 1\n    0 1 1\n    0 2 4\n    2 0 1\n    1 2 2\n    3 1 1\n    3 2 5", "output": "3\n    0\n    2\n    INF"}]