#include <fstream>
#include <vector>
#define INF 1000000000

using namespace std;

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

int n,m,i,x,y,c,d[50005],f[50005];
vector< pair <int, int> > L[50005];

int main()
{
    fin >> n >> m;
    for (i=1; i<=m; i++)
    {
        fin >> x >> y >> c;
        L[x].push_back(make_pair(y, c));
    }
    for (i=1; i<=n; i++)
        d[i] = INF;
    d[1] = 0;
    while (1)
    {
        int minim = INF; int nod = 0;
        for (i=1; i<=n; i++)
            if (f[i] == 0 && d[i] < minim)
            {
                minim = d[i];
                nod = i;
            }
        if (minim == INF)
            break;
        f[nod] = 1;
        for (i=0; i<L[nod].size(); i++)
        {
            int vecin = L[nod][i].first;
            int cost = L[nod][i].second;
            if (d[vecin] > d[nod]+cost)
                d[vecin] = d[nod]+cost;
        }
    }
    for (i=2; i<=n; i++)
        if (d[i] != INF)
            fout << d[i] << " ";
        else
            fout << 0 << " ";
    return 0;
}