#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define nodv i.second
#define costv i.first
using namespace std;

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

using VI = vector<int>;
using VII = vector<pair<int, int>>;
using VVI = vector<VI>;
using VVII = vector<VII>;

int n, m;
VI d;
VVII g;

void Read();

int main()
{
    Read();
    d = VI(n + 1, INF);
    d[1] = 0;
    priority_queue<pair<int, int>, VII, greater<pair<int, int>>> q;
    q.push(make_pair(0, 1));
    int nod, cost;
    while ( !q.empty() )
    {
        nod = q.top().second;
        cost = q.top().first;
        q.pop();
        if ( cost > d[nod] )
            continue;
        for ( const auto &i : g[nod] )
            if ( d[nodv] > d[nod] + costv )
            {
                d[nodv] = d[nod] + costv;
                q.push(make_pair(d[nodv], nodv));
            }

    }
    for ( int i = 2; i <= n; ++i )
        if ( d[i] == INF )
            os << "0 ";
        else
            os << d[i] << " ";
    is.close();
    os.close();
    return 0;
}

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