#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, i, x, y, c;
vector <vector <int>> v, ct;
vector <int> viz, ciclu;
const int oo = 2e7;
set <pair<int, int>> q;
int main()
{
    fin >> n >> m; v.resize(n+1); ct.resize(n+1); viz.resize(n+1); ciclu.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        v[x].push_back(y);
        ct[x].push_back(c);
    }
    for (i = 2; i <= n; i++)
            viz[i] = oo;
    q.insert(make_pair(0, 1));
    while (!q.empty())
    {
        x = (*q.begin()).second;
        c = (*q.begin()).first;
        q.erase(q.begin());
        for (i = 0; i < v[x].size(); i++)
        {
            if (viz[v[x][i]] != oo)
                q.erase(q.find(make_pair(viz[v[x][i]], v[x][i])));
            if (viz[v[x][i]] > viz[x] + ct[x][i])
                viz[v[x][i]] = viz[x] + ct[x][i], q.insert(make_pair(viz[v[x][i]], v[x][i]));
        }
    }
    for (i = 2; i <= n; i++)
    {
        fout << viz[i] << " ";
    }
    return 0;
}