#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define MAX 50005
#define INF (1<<30)
vector < pair < int, int > > v[MAX];
priority_queue < pair < int, int > > Q;
int cost[MAX];
int main()
{
    int n, m, x, y, c;
    fin >> n >> m;
    for(int i = 1; i<=m; i++)
    {
        fin >> x >> y >> c;
        v[x].push_back(make_pair(y, c));
    }
    Q.push(make_pair(0, 1));
    for(int i = 2; i<=n; i++)
        cost[i] = INF;
    while(!Q.empty())
    {
        int nod = Q.top().second;//extragem nodu' cu distanta minima
        Q.pop();
        for(int j = 0; j<v[nod].size(); j++)//parcurgem vecinii sa facem imbunatatiri
        {
            int vecin = v[nod][j].first;
            if(cost[vecin] > cost[nod] + v[nod][j].second)
            {
                cost[vecin] = cost[nod] +  v[nod][j].second;
                Q.push(make_pair(-cost[vecin], vecin));
            }

        }
    }
    for(int i = 2; i<=n; i++)
        fout << cost[i] << " ";
    return 0;
}