#include <fstream>
#include <vector>
#include <queue>
#include <functional>

using namespace std;

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

vector < pair < int,int > > l[250010];
priority_queue< pair < int,int > , vector < pair < int,int > > , greater < pair < int,int > > > qu;
int n,m,i,j,mix,d[50010],nr,x,y,z,k,maxi=1000000000;
bool viz[50010];

void bfssauceva()
{
    while(qu.empty()==0)
    {
        nr=qu.top().second;
        qu.pop();
        if(viz[nr]==0)
        {
            viz[nr]=1;
            for(int i=0;i<l[nr].size();++i)
            {
                d[l[nr][i].first]=min(d[l[nr][i].first],d[nr]+l[nr][i].second);
                if(viz[l[nr][i].first]==0)
                    qu.push({d[l[nr][i].first],l[nr][i].first});
            }
        }
    }

    /*int ko=0;
    viz[x]=1;
    for(int i=0;i<l[x].size();++i)
    {
        d[l[x][i].first]=min(d[l[x][i].first],d[x]+l[x][i].second);
        if(viz[l[x][i].first]==0)
            qu.push({d[l[x][i].first],l[x][i].first});
    }
    while(qu.empty()==0)
    {
        ko=qu.top().second;
        qu.pop();
        if(viz[ko]==0)
        {
            bfssauceva(ko);
            return;
        }
    }*/
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>z;
        l[x].push_back({y,z});
    }
    for(i=2;i<=n;++i)
        d[i]=maxi;
    nr=1;
    k=1;
    qu.push({0,1});
    bfssauceva();
    for(i=2;i<=n;++i)
    {
        if(d[i]==maxi)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}