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

#define N 50005
#define inf (1 << 30)

using namespace std;

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

int n, m;
struct nod{int n, c;};
vector <int> d(N, inf);
vector <nod> a[N];
queue <int> q;

int main()
{
    fin>>n>>m;
    int x, y, l;
    nod vf;
    while(m--)
    {
        fin>>x>>y>>l;
        vf.c = l, vf.n = y;
        a[x].push_back(vf);
    }
    q.push(1);
    d[1] = 0;
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(unsigned i=0; i<a[x].size(); ++i)
            if(d[x] + a[x][i].c < d[a[x][i].n])
            {
                d[a[x][i].n] = d[x] + a[x][i].c;
                q.push(a[x][i].n);
            }
    }
    for(int i=2; i<=n; i++)
        if(d[i] == inf) fout<<0<<' ';
        else fout<<d[i]<<' ';
    return 0;
}