#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int VMax = 50005;
const int oo = 1e9;

int n, m;
int D[VMax], Viz[VMax];
vector < pair < int, int > > G[VMax];

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

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

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

void Dijkstra(int k)
{
    for(int i = 1 ; i <= n ; ++i)
        D[i] = oo;

    D[k] = 0;
    Q.push(k);
    Viz[k] = 1;
    while(!Q.empty())
    {
        int nodC = Q.top();
        Q.pop();
        for(unsigned int i = 0 ; i < G[nodC].size(); ++i)
        {
            int Vecin = G[nodC][i].first;
            int Cost = G[nodC][i].second;
            if(D[nodC] + Cost < D[Vecin])
            {
                D[Vecin] = D[nodC] + Cost;
                if(!Viz[Vecin])
                {
                    Q.push(Vecin);
                    Viz[Vecin] = 1;
                }
            }
        }
    }
}

void Afisare()
{
    for(int i = 2 ; i <= n ; ++i)
    {
        if(D[i] != oo) fout << D[i] << " ";
        else fout << "0 ";
    }
}

int main()
{
    Citire();
    Dijkstra(1);
    Afisare();
    return 0;
}