#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define NMAX 50005
#define MMAX 1000000

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int d[NMAX], n, m;
int oo=(1<<31)-1;
vector < pair <int , int> > v[NMAX];
bool incoada[NMAX];

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

priority_queue <int, vector <int>, compara> coada;

void read()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
    int x, y, cost;
    fin>>x>>y>>cost;
    v[x].push_back(make_pair(y, cost));
    }
}

void dijk(int nod)
{
     for(int i=2; i<=n; i++)
     d[i]=oo;
     d[nod]=0;
     coada.push(nod);
     incoada[nod]=true;
     while(!coada.empty())
     {
     nod=coada.top();
     coada.pop();
     incoada[nod]=false;
     for(unsigned int i=0; i<v[nod].size(); i++)
     {
     int vecin=v[nod][i].first;
     int cost=v[nod][i].second;
     if(d[nod]+cost<d[vecin])
     {
     d[vecin]=d[nod]+cost;
     if(incoada[vecin]==false)
     {
     coada.push(vecin);
     incoada[vecin]=true;
     }
     }
     }
     }
}

int main()
{
    read();
    dijk(1);
    for(int i=2; i<=n; i++)
    if(d[i]==oo) fout<<"0 ";
    else
    fout<<d[i]<<" ";
    return 0;
}