#include <fstream>
#include <vector>
#include <queue>

#define NMAX 50005
#define INF 2147483646
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

vector< pair<int, int> > a[NMAX];
queue<int> q;
int d[NMAX];

int n, m;

int main()
{
    int x, y, c, nod;

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

    for (int i = 1; i <= n; ++i)
        d[i] = INF;
    d[1] = 0;

    q.push(1);
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        for (vector< pair<int, int> >::iterator it = a[nod].begin(); it != a[nod].end(); ++it)
            if (d[nod] + it->second < d[it->first])
            {
                d[it->first] = d[nod] + it->second;
                q.push(it->first);
            }
    }
    for (int i = 2; i <= n; ++i)
        if (d[i] < INF) fout << d[i] << ' ';
        else fout << '0' << ' ';
    fin.close();
    fout.close();
    return 0