import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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()
    neib = newseqwith(n,newseqwith(n,int.high))
    es = newseqwith(n,newseq[int]())
    cs = newseqwith(n,newseq[int]())
    touch = newseqwith(n,false)
    dist = newseqwith(n,int.high)
  for i in 0..<m:
    var
      (a,b,d) = (scan()-1,scan()-1,scan())
    neib[a][b].min=d
    es[a].add(b)
    cs[a].add(d)

  proc bfs(s:int):int=
    touch.fill(false)
    dist.fill(int.high)
    var
      q = initHeapQueue[(int,int)]()
    q.push((s,0))
    while q.len>0:
      var
        (p,cost) = q.pop()
      if dist[p] <= cost:continue
      dist[p]=cost
      touch[p]=true
      for (ncost,nxt) in zip(cs[p],es[p]):
        if dist[nxt] > cost+ncost:
          q.push((nxt,cost+ncost))
    for (t,c) in zip(touch,dist):
      if t:
        result+=c
    
  for i in 0..<n:
    echo bfs(i)
  
solve()