#include <iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,start=1,x,y,c,nod,vecin,cost;
int d[10000005],viz[10000005];
priority_queue<pair<int,int>> PQ;
vector<pair<int,int>> L[10000005];
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        L[x].push_back({y,c});
    }
    for(int i=1;i<=n;i++)
    {
        d[i]=10000005;
    }
    d[start]=0;
    PQ.push({-d[start],start});
    while(!PQ.empty())
    {
        nod=PQ.top().second;
        PQ.pop();
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        for(auto muchie : L[nod])
        {
            vecin=muchie.first;
            cost=muchie.second;
            if(d[vecin]>d[nod]+cost && d[nod]!=10000005)
            {
                d[vecin]=d[nod]+cost;
                PQ.push({-d[vecin],vecin});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==10000005)
        {
            fout<<0<<" ";
        }
        else
            fout<<d[i]<<" ";
    }
    return 0;
}