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

#define nod first
#define cost second

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

int N, M, x, y, z, D[50002];
vector <pair<int,int> > V[50002];
priority_queue <int, vector<int>, greater<int> > Q;

void Dijkstra();

int main()
{
    is >> N >> M;
    for (int i = 1; i <= M; ++i)
    {
        is >> x >> y >> z;
        V[x].push_back(make_pair(y, z));
    }
    Dijkstra();
    for (int i = 2; i <= N; ++i)
        if (D[i] == 0x3f3f3f3f)
            os << "0 ";
        else
            os << D[i] << ' ';
}

void Dijkstra()
{
    memset(D, 0x3f3f3f3f, sizeof(D));
    int i, j;
    D[1] = 0;
    for (Q.push(1); !Q.empty(); Q.pop())
    {
        i = Q.top();
        for (int j = 0; j < V[i].size(); ++j)
        {
            if (D[V[i][j].nod] > D[i] + V[i][j].cost)
            {
                D[V[i][j].nod] = D[i] + V[i][j].cost;
                Q.push(V[i][j].nod);
            }
        }
    }
};