#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, i, j, k, x, y, c;
const int oo = 2e7;
vector <int> d;
vector <vector <int>> v, ct;
int main()
{
    fin >> n >> m; v.resize(n+1); ct.resize(n+1); d.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++)
        d[i] = oo;
    queue <int> q;
    q.push(1);
    while (!q.empty())
    {
        x = q.front();
        q.pop();
        for (i = 0; i < v[x].size(); i++)
        {
            if (d[v[x][i]] > d[x] + ct[x][i])
                d[v[x][i]] = d[x] + ct[x][i], q.push (v[x][i]);
        }
    }
    for (i = 2; i <= n; i++)
    {
        fout << d[i] << " ";
    }
    return 0;
}