#include <fstream>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,x,y,c,start=1,d[50001],minn,MAXX=10000000;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
vector <pair<int,int> >muchie[50001];
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>c;
        muchie[x].push_back({y,c});
    }
    for(int i=1; i<=n; i++)
        d[i]=MAXX;
    d[start]=0;
    q.push({0,start});
    while(q.size())
    {
        x=q.top().second;
        q.pop();
        for(int i=0;i<muchie[x].size();i++)
        {
            y=muchie[x][i].first;
            c=muchie[x][i].second;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                q.push({d[y],y});
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i]!=MAXX)
            g<<d[i]<<" ";
        else g<<"0 ";
    return 0;
}