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

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

typedef vector<int> VI;
typedef pair<int, int> II;
typedef vector<II> VII;
typedef pair<int, II> III;
typedef vector<III> VIII;
typedef vector<VII> VVII;

int n, m;
VI d;
VVII g;

void Read();
void Write();

int main()
{
    Read();
    d = VI(n + 1, INF);
    d[1] = 0;
    set<pair<int, int>> t;
    t.insert(make_pair(0, 1));
    int nod, cost;
    while ( !t.empty() )
    {
        nod = t.begin()->second;
        cost = t.begin()->first;
        t.erase(t.begin());
        if ( d[nod] != cost )
            continue;
        for ( const auto& nodv : g[nod] )
            if ( d[nodv.second] > d[nod] + nodv.first )
            {
                d[nodv.second] = d[nod] + nodv.first;
                t.insert(make_pair(d[nodv.second], nodv.second));
            }
    }
    Write();
    is.close();
    os.close();
    return 0;
}

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

void Read()
{
    is >> n >> m;
    g = VVII(n + 1);
    int x, y, cost;
    for ( int i = 1; i <= m; ++i )
    {
        is >> x >> y >> cost;
        g[x].push_back(make_pair(cost, y));
    }
}