#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#define inf 0x3f3f3f3f

using namespace std;

vector <pair<int,int> >g[50005];
int n,m,d[50005];
bool viz[50005];
queue <int> q;

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

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(y,c));
    }
    memset(d,inf,sizeof(d));
}

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

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

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