#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int NMAX = 50001;
const int INF = 1 << 27;
vector<pair<int, int> > G[NMAX];
priority_queue<int, vector<int>, greater<int> > Q;
int d[NMAX], t[NMAX], n, m;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

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

void Dijkstra(int x0)
{
    for(int i = 1; i <= n; i++)
    {
        d[i] = INF;
        t[i] = x0;
    }
    d[x0] = 0;
    t[x0] = 0;
    Q.push(x0);
    while(!Q.empty())
    {
        int vfmin = Q.top();
        Q.pop();
        for(int i = 0; i < G[vfmin].size(); i++)
        {
            int ymin = G[vfmin][i].first;
            int cost = G[vfmin][i].second;
            int suma = d[vfmin] + cost;
            if(d[ymin] > suma)
            {
                d[ymin] = suma;
                t[ymin] = vfmin;
                Q.push(ymin);
            }
        }
    }
}

void drum(int i)
{
    if(t[i] != 0)
        drum(t[i]);
    cout << i << " ";
}
void afisare(int x)
{
    for(int i = 1; i <= n; i++)
        if(i != x)
        {
            if(d[i] != INF)
                g << d[i] << ' ';
            else
                g << "0 ";
        }
}
int main()
{
    citire();
    Dijkstra(1);
    afisare(1);
    return 0;
}