#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream fi ("dijkstra.in");
ofstream fo ("dijkstra.out");
int nrnod,nrarc,dist[50006];
bool viz[50006];
struct str{int nod,dist;};
struct comp{
bool operator()(const str& a,const str& b)
{
    if (a.dist<b.dist) return 1;
    if (a.dist>b.dist) return 0;
    return (a.nod>b.nod);
}
};
vector<int> v[50006],cost[50006];
set<str,comp> myset;
set<str,comp>::iterator it;
int main()
{
    fi>>nrnod>>nrarc;
    for (int i=1;i<=nrarc;i++)
    {
      int ni,nf,c;
      fi>>ni>>nf>>c;
      v[ni].push_back(nf);
      cost[ni].push_back(c);
    }
    for (int i=1;i<=nrnod;i++) dist[i]=1000000000;
    dist[1]=0;
    str el;
    el.nod=1;el.dist=0;myset.insert(el);
    while (!myset.empty())
    {
        it=myset.begin();el=*it;myset.erase(it);
        int nod=el.nod;
        if (viz[nod]) continue;
        viz[nod]=1;
        for (int i=0;i<v[nod].size();i++)
        {
            int nodurm=v[nod][i];
            int costdrum=cost[nod][i];
            if (dist[nod]+costdrum<dist[nodurm])
            {
                dist[nodurm]=dist[nod]+costdrum;
                el.nod=nodurm;
                el.dist=dist[nodurm];
                myset.insert(el);
            }
        }
    }
    for (int i=2;i<=nrnod;i++) fo<<dist[i]<<' ';
//    el.nod=2;el.dist=5;myset.insert(el);
//    it=myset.begin();el=*it;
//    fo<<el.nod;
    return 0;
}