#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, x, y, c, i, j, path[50001];
const int oo = 2e8;
vector <vector <pair <int, int> > > G;
void dijkstra (int start)
{
    set <pair <int, int> > s;
    for (i = 2; i <= n; i++)
        path[i] = oo;
    s.insert ({0, 1});
    while (!s.empty())
    {
        x = (*s.begin()).second;
        c = (*s.begin()).first;
        s.erase(s.begin());
        for (i = 0; i < G[x].size(); i++)
        {
            if (path[G[x][i].first] > G[x][i].second + c)
            {
                if (s.find({path[G[x][i].first], G[x][i].first}) != s.end())
                    s.erase(s.find({path[G[x][i].first], G[x][i].first}));
                path[G[x][i].first] = G[x][i].second + c;
                s.insert ({path[G[x][i].first], G[x][i].first});
            }
        }
    }
}
int main()
{
    fin >> n >> m; G.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    dijkstra(1);
    for (i = 2; i <= n; i++)
        fout << path[i]*(path[i] != oo) << " ";
    return 0;
}