import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')


proc solve()=
  var
    n = scan()
    m = scan()
    es = newseqwith(n,newseq[int]())
    cs = newseqwith(n,newseq[int]())
  for i in 0..<m:
    var
      (a,b,c) = (scan()-1,scan()-1,scan())
    es[a].add(b)
    es[b].add(a)
    cs[a].add(c)
    cs[b].add(c)
  # 無視した最大重みの辺を保持してbfsは？
  var
    cost = newseqwith(n,newseqwith(2,int.high.div(4)))

  proc bfs(s:int)=
    # (コスト、頂点、チケット使用フラグ)
    var q = initDeque[(int,int,int)]()
    cost[s][0]=0
    cost[s][1]=0
    q.addLast((0,s,0))
    q.addLast((0,s,1))
    while q.len>0:
      var
        (cst,v,ticket) = q.popFirst()
      if cost[v][ticket]<cst:continue
      for nIdx in 0..<es[v].len:
        var
          nxt = es[v][nIdx]
          c = cs[v][nIdx]
        if cost[nxt][0] > cost[v][0]+c:
          cost[nxt][0] = cost[v][0]+c
          q.addLast((cost[nxt][0],nxt,0))
        if cost[nxt][1] > min(cost[v][0],cost[v][1]+c):
          cost[nxt][1] = min(cost[v][0],cost[v][1]+c)
          q.addLast((cost[nxt][1],nxt,1))
        
  bfs(0)
  #echo cost.join("\n")
  
  for i in 0..<n:
    echo cost[i][0]+cost[i][1]


      


  
  
  
solve()