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

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

#define INF 0x3f3f3f3f

int n, m;
int x, y, cost;
vector<vector<pair<int, int>>> G;
vector<int> d;
vector<bool> s;
queue<int> q;

void Bfs( int k );

int main()
{
    is >> n >> m;
    G.resize(n+1);
    d = vector<int>(n+1, INF);
    s = vector<bool>(n+1, false);
    for ( int i = 1; i <= m; i++ )
    {
        is >> x >> y >> cost;
        G[x].push_back({y, cost});
    }

    d[1] = 0;
    s[1] = true;
    Bfs(1);

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

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

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

}