#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
#define NMax 50005
#define oo (1LL << 30)

int N,M;
bool incoada[NMax];
int D[NMax];

struct cmp
{
    bool operator()(int x, int y)
    {
        return D[x]>D[y];
    }
};

vector < pair <int, int> > V[NMax];
priority_queue <int, vector <int>, cmp> 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;
    incoada[nodStart]=true;
    Q.push(nodStart);
    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)
            {
                Q.push(Vecin);
                incoada[Vecin]=true;
            }
        }
    }
}
}

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