#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define NMax 50005
#define oo (1 << 30)
int N,M;
int D[NMax];

bool incoada[NMax];
struct compara
{
    bool operator()(int x,int y)
     {return D[x]>D[y];}
};
vector< pair <int,int> >V[NMax];
priority_queue < int, vector<int> ,compara> Q;

void read()
{
  f>>N>>M;
  for(int i=1;i<=M;i++)
  {
      int x,y,c;
      f>>x>>y>>c;
      V[x].push_back(make_pair(y,c));
  }
}
void write()
{
 for(int i=2;i<=N;i++)
 {
     if(D[i]!=oo)
        g<<D[i]<<" ";
     else
        g<<0<<" ";
 }
}
void Dijkstra(int nodStart)
{
    for(int i=1;i<=N;i++)
        D[i]=oo;
    D[nodStart]=0;
    Q.push(nodStart);
    incoada[nodStart]=true;
    while(!Q.empty())
    {
        int nodCurent=Q.top();
        Q.pop();
        incoada[nodCurent]=false;
        for(size_t i=0;i<V[nodCurent].size();i++)
        {
            int Vecin = V[nodCurent][i].first;
            int Cost =  V[nodCurent][i].second;
            if(D[nodCurent]+Cost<D[Vecin])
            {
                D[Vecin]=D[nodCurent]+Cost;
                if(incoada[Vecin]==false)
                {
                    incoada[Vecin]=true;
                    Q.push(Vecin);
                }
            }
        }
    }
}

int main()
{
    read();
    Dijkstra(1);
    write();
    return 0;
}