#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 viz[nmax];
vector < pair < int, int > > v[nmax];

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

priority_queue < int, vector < int >, compara > C;

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;
    C.push(nodstart);
    viz[nodstart] = true;
    while(!C.empty())
    {
        int nodcurent = C.top();
        C.pop();
        viz[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(viz[vecin] == false)
                {
                    C.push(vecin);
                    viz[vecin] = true;
                }
            }

        }
    }
}
void afiseaza()
{
    for(int i = 2; i <= n; ++i)
    {
        if(d[i] == oo)
            fout << "0 ";
        else
            fout << d[i] << " ";
    }
}
int main()
{
    read();
    dijkstra(1);
    afiseaza();
    return 0;
}