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

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

int N, M, D[50005];
vector < pair <int, int> > v[50005];

struct CMP{
    bool operator()(int a, int b) {   return D[a]>D[b];   }
};

priority_queue <int, vector<int>, CMP> Q;

int main()
{
    is >> N >> M;
    for (int i = 2; i <= N; ++i)
        D[i] = 0x3f3f3f3f;
    for (int i = 1, a, b, c; i <= M; ++i)
    {
        is >> a >> b >> c;
        v[a].push_back({b, c});
    }
    Q.push(1);
    for (int i, nod, cost; !Q.empty();)
    {
        i = Q.top();
        Q.pop();
        for (int j = 0; j < v[i].size(); ++j)
        {
            nod = v[i][j].first;
            cost = v[i][j].second;
            if (D[nod] > D[i] + cost)
            {
                D[nod] = D[i] + cost;
                Q.push(nod);
            }
        }
    }
    for (int i = 2; i <= N; ++i)
        os << D[i] << ' ';
}