#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 50005;
const int oo = (1 << 30);

int n, m;
int D[NMax];
bool InQ[NMax];

vector < pair <int, int> > V[NMax];
priority_queue <int, vector < int > > Q;

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

void Dijkstra(int nodStart)
{
    for(int i = 1; i <= n; i++)
        D[i] = oo;
    D[nodStart] = 0;
    Q.push(nodStart);
    InQ[nodStart] = true;
    while(!Q.empty())
    {
        int nodCurent = Q.top();
        Q.pop();
        InQ[nodCurent] = false;
        for(unsigned int i = 0; i < V[nodCurent].size(); i++)
        {
            int Vecin = V[nodCurent][i].first;
            int Cost = V[nodCurent][i].second;
            if(D[nodCurent] + Cost < D[Vecin])
            {
                D[Vecin] = D[nodCurent] + Cost;
                if(InQ[Vecin] == false)
                {
                    Q.push(Vecin);
                    InQ[Vecin] = true;
                }
            }
        }
    }
}

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

int main()
{
    Read();
    Dijkstra(1);
    Afiseaza();
    return 0;
}