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

const string fis = "dijkstra";
ifstream is(fis + ".in");
ofstream os(fis + ".out");

using VI = vector<int>;
using VS = vector<short>;
using VVI = vector<VI>;
using VP = vector<pair<int, int>>;
using VVP = vector<VP>;

int n, m;
int n1, n2, cost;
VI d;
VVP g;

int main()
{
    is >> n >> m;
    d = VI(n + 1, INF);
    d[1] = 0;
    g = VVP(n + 1);
    while ( m-- )
    {
        is >> n1 >> n2 >> cost;
        g[n1].push_back(make_pair(cost, n2));
    }
    priority_queue<pair<int, int>, VP, greater<pair<int, int>>> q;
    q.push(make_pair(0, 1));
    int nod;
    while ( !q.empty() )
    {
        nod = q.top().second;
        cost = q.top().first;
        q.pop();
        if ( cost > d[nod] )
            continue;
        for ( const auto& nodv : g[nod] )
            if ( d[nodv.second] > d[nod] + nodv.first )
            {
                d[nodv.second] = d[nod] + nodv.first;
                q.push(make_pair(d[nodv.second], nodv.second));
            }
    }
    for ( int i = 2; i <= n; ++i )
        if ( d[i] == INF )
            os << "0 ";
        else
            os << d[i] << " ";
    is.close();
    os.close();
    return 0;
}