program blemalgha;
type hacking=record
 nod,cost:longint;
end;
var f,g:text;
    n,m,i,x,y,z:longint;
    a:array of array of hacking;
    c:array[1..500000] of longint;
    ps,pi:longint;
    d:array[1..50000] of longint;
    bufin,bufout:array[1..65000] of byte;
    nr,wnod,wcost:longint;

begin
 assign (f,'dijkstra.in'); reset (f);
 assign (g,'dijkstra.out'); rewrite (G);
 settextbuf (f,bufin); settextbuf (g,bufout);
 readln (f,n,m);
 setlength(a,n+1,1);
 for i:=1 to m do
 begin
  readln (f,x,y,z);
  setlength(a[x],length(a[x])+1);
  inc(a[x,0].nod);
  a[x,a[x,0].nod].nod:=y;
  a[x,a[x,0].nod].cost:=z;
 end;
 for i:=2 to n do d[i]:=maxlongint;
 ps:=0; pi:=1;
 c[1]:=1;
 while ps<pi do
 begin
  inc(ps);
  nr:=c[ps];
  for i:=1 to a[nr,0].nod do
  begin
   wnod:=a[nr,i].nod;
   wcost:=a[nr,i].cost;
   if d[wnod]>d[nr]+wcost then
   begin
    inc(pi);
    c[pi]:=wnod;
    d[wnod]:=d[nr]+wcost;
   end;
  end;
 end;
 for i:=2 to n do
 begin
  if d[i]=maxlongint then d[i]:=0;
  write (g,d[i],' ');
 end;
 close (F); close (g);
end.