#include <fstream>
#include <queue>
#include <vector>
#define inf INT_MAX
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int d[50005],n,m,a,b,c,i,viz[50005];
priority_queue < pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > q;
vector<pair<int,int> >v[50005];
void dijkstra()
{
    for(i=1;i<=n;i++) d[i]=inf;
    d[1]=0;
    q.push({0,1});
    while(!q.empty())
    {
        int nod=q.top().second;
        q.pop();
        if(!viz[nod])
        for(int j=0;j<v[nod].size();j++)
        {
            if(d[nod]+v[nod][j].first<d[v[nod][j].second])
            {
                d[v[nod][j].second]=d[nod]+v[nod][j].first;
                q.push({d[v[nod][j].second],v[nod][j].second});
            }
        }
        viz[nod]=1;
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        v[a].push_back({c,b});
    }
    dijkstra();
    for(i=2;i<=n;i++) g<<d[i]<<" ";
    return 0;
}