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

#define nod first
#define cost second
#define INF 1<<24
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));
    }
    for (int i = 2; i <= N; ++i) D[i] = INF;
    Dijkstra();
    for (int i = 2; i <= N; ++i)
        if (D[i] == INF)
            os << "0 ";
        else
            os << D[i] << ' ';
}

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