#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("dijkstra.in");
ofstream os("dijkstra.out");

int n;
vector <vector <pair < int, int> > > G;
vector <int> d;
queue <int> q;

void Read();
void Dijkstra( int x );
void Write();

int main()
{
    Read();
    Dijkstra(1);
    Write();

    is.close();
    os.close();
    return 0;
}

void Read()
{
    int m, x, y, cost;
    is >> n >> m;
    G.resize(n+1);
    d.resize(n+1, INF);
    while( m-- )
    {
        is >> x >> y >> cost;
        G[x].push_back(make_pair(y, cost));
    }
}

void Dijkstra(int x)
{
    d[x] = 0;
    q.push(x);
    while ( !q.empty() )
    {
        x = q.front();
        q.pop();
        for ( const auto & i : G[x] )
            if ( d[i.first] > d[x] + i.second )
            {
                d[i.first] = d[x] + i.second;
                q.push(i.first);
            }
    }

}

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