#include <bits/stdc++.h>
#define Nmax 50005
#define Mmax 250005
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

vector< pair < int, int > > G[Nmax];

int n, m ;
int x, y, c;
bool viz[Nmax];
int D[Nmax];

struct comparaDistante
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};

priority_queue<int , vector < int > , comparaDistante > coada;

void afisare()
{
    for (int i=2; i<=n; i++)
    {
        if (D[i] == INT_MAX)
            fout<<0;
        else
            fout<<D[i];
        fout<<" ";
    }
    fout<<"\n";
    fin.close();
    fout.close();
}
void Dij(int start)
{
    viz[start] = 1;
    D[start] = 0;
    for (int i=2; i<=n; i++)
        D[i] = INT_MAX;
    coada.push(start);
    viz[start] = 1;

    while (!coada.empty())
    {
        int nodCurent = coada.top();
        coada.pop();

        for (size_t i =0; i<G[nodCurent].size(); i++)
        {
            int vecin = G[nodCurent][i].first;
            int cost = G[nodCurent][i].second;

            if (D[vecin] > D[nodCurent] + cost)
            {
                D[vecin] = D[nodCurent] + cost;
                if (viz[vecin] == 0)
                {
                    coada.push(vecin);
                    viz[ vecin ] = 1;
                }
            }
        }

    }
    afisare();

}
void citire()
{
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y, c));
    }
    Dij(1);
}
int main()
{
    citire();
    return 0;
}