#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define PII pair<int,int>
#define N 50001
#define INF 20000*50000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, i, j, ans[N], x, y, c;
vector<PII> v[N];
bool viz[N];
priority_queue<PII,vector<PII>,greater<PII> > pq;
void dijk(int nod)
{
    for(i=1;i<=n;++i)
        if(i!=nod)
        ans[i]=INF;
    else ans[i]=0;
    pq.push({0,1});
    while(!pq.empty())
    {
        PII f=pq.top();
        if(viz[f.nd])
        {
            pq.pop();
            continue;
        }
        viz[f.nd]=1;
        nod=f.nd;
        pq.pop();
        for(auto i:v[nod])
            if(!viz[i.st]&&ans[i.st]>ans[nod]+i.nd)
            {
                ans[i.st]=ans[nod]+i.nd;
                pq.push({i.nd,i.st});
            }
    }
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>c;
        v[x].pb({y,c});
        v[y].pb({x,c});
    }
    dijk(1);
    for(i=2;i<=n;++i)
        fout<<(ans[i]==INF?0:ans[i])<<' ';
    return 0;
}