#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
const int INF=1000000000; //1e9
const int nmax=50001;
vector<pair<int, int> >v[nmax];
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > >h;
int d[nmax];
bool f[nmax];

int main()
{
    int n, m, a, b, c, i, nod;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(c, b));
    }
    for(i=1; i<=n; i++)
    {
        d[i]=INF;
    }d[1]=0;
    h.push(make_pair(0, 1));
    while(!h.empty())
    {
        nod=h.top().second;
        h.pop();
        if(f[nod]==0)
        {
            for(i=0; i<v[nod].size(); i++)
            {
                if(d[nod]+v[nod][i].first<d[ v[nod][i].second ])
                {
                    d[ v[nod][i].second ]=d[nod]+v[nod][i].first;
                    h.push(make_pair(d[ v[nod][i].second ], v[nod][i].second));
                }
            }
        }
        f[nod]=1;
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]==INF) fout<<0<<' ';
        else fout<<d[i]<<' ';
    }
}