#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define nmax 50003
#define cost first
#define vecin second
#define inf 0x3f3f3f3f

using namespace std;

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

int n,m,d[nmax];
vector<pair<int,int> >g[nmax];
priority_queue<pair<int,int> >q;

void citire()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(c,y));
    }
    memset(d,inf,sizeof(d));
}

void dijkstra()
{
    int k;
    d[1]=0;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        k=q.top().second;
        q.pop();
        vector<pair<int,int> >::iterator ii;
        for(ii=g[k].begin();ii!=g[k].end();++ii)
            if(d[k]+ii->cost<d[ii->vecin])
            {
                d[ii->vecin]=d[k]+ii->cost;
                q.push(make_pair(-d[ii->vecin],ii->vecin));
            }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
}

int main()
{
    citire();
    dijkstra();
    afisare();
    return 0;
}