#include <bits/stdc++.h>
#define Nmax 50005
#define infinit 999999999
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct edge
{
    int nod,dist;
    bool operator <(const edge &A) const
    {
        return dist>A.dist;
    }
};
vector <pair<int,int> > L[Nmax];
int n,m,dp[Nmax];
priority_queue <edge> q;


void Citire()
{
    int i,x,y,l;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>l;
        L[x].push_back(make_pair(y,l));
        L[y].push_back(make_pair(x,l));
    }
    fin.close();
}

void Dijkstra()
{
    edge w,w1;
    int i;
    for(i=1;i<=n;i++) dp[i]=infinit;
    w.nod=1;
    w.dist=0;
    q.push(w);
    while(!q.empty())
    {
        w=q.top();
        q.pop();
        for(i=0;i<L[w.nod].size();i++)
        {
            w1.nod=L[w.nod][i].first;
            w1.dist=w.dist+L[w.nod][i].second;
            if(w1.dist<dp[w1.nod])
            {
                dp[w1.nod]=w1.dist;
                q.push(w1);
            }
        }
    }
    for(i=2;i<=n;i++)
        if(dp[i]!=infinit) fout<<dp[i]<<" ";
        else fout<<"0 ";
    fout<<endl;
}

int main()
{
    Citire();
    Dijkstra();
    return 0;
}