#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,m,dp[50005];
vector< pair<int,int> > vecini[50005];

set< pair<int,int> >coada;

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y,cost;
        f>>x>>y>>cost;
        vecini[x].push_back( make_pair(y,cost) );
        vecini[y].push_back( make_pair(x,cost) );
    }
    for(int i=1;i<=n;i++) dp[i]=2000000000;
    dp[1]=0;
    coada.insert( make_pair(0,1) );

    while( !coada.empty() )
    {
        int nod=coada.begin()->second;
        coada.erase(coada.begin());

        for(int i=0; i<vecini[nod].size(); i++)
        {
          int x=vecini[nod][i].first,cost=vecini[nod][i].second;

          if( dp[nod]+cost<dp[x] )
          {
           coada.erase( make_pair(dp[x],x) );
           dp[x]=dp[nod]+cost;
           coada.insert( make_pair(dp[x],x) );
          }
        }
    }
    for(int i=2;i<=n;i++) g<<dp[i]<<' ';
}