#include <fstream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;

#define NMAX 50001
#define INF 0x3f3f3f3f
typedef vector<pair<int, int> >::iterator IT;

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

int n, m, d[NMAX];
set<pair<int, int> > T;
vector<pair<int, int> > G[NMAX];

void Solve();

int main()
{
    int x, y, c;
    fin >> n >> m;
    for( int i = 1; i <= m; ++i )
    {
        fin >> x >> y >> c;
        G[x].push_back(make_pair(c, y));
    }
    Solve();
    fin.close();
    fout.close();
    return 0;
}

void Solve()
{
    int dist, x;
    for( int i = 1; i <= n; ++i )
        d[i] = INF;
    d[1] = 0;
    T.insert(make_pair( 0, 1 ));
    while( !T.empty() )
    {
        dist = T.begin() -> first;
        x = T.begin() -> second;
        T.erase(T.begin());
        for( IT it = G[x].begin(); it != G[x].end(); ++it )
        {
            if( d[it->second] > dist + it->first )
            {
                d[it->second] = dist + it->first;
                T.insert( make_pair( d[it->second], it->second ) );
            }
        }
    }

    for( int i = 2; i <= n; ++i )
        if( d[i] != INF )
            fout << d[i] << ' ';
        else
            fout << "0 ";
}