#include<fstream>
#include<vector>
#include<queue>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

#define INF 100000000

int n, m;

vector<vector<pair<int, int> > > G;
queue<int> Q;

int d[50010];

void Read();
void B();
void Write();

int main()
{
    Read();
    B();
    Write();
    
    fin.close();
    fout.close();
}

void Read()
{
    fin >> n >> m;
    G.resize(n+2);
    
    int a, b, c;
    
    for( int i = 1; i <= m; ++i )
    {
        fin >> a >> b >> c;
        G[a].push_back( make_pair(b, c) );
        G[b].push_back( make_pair(a, c) );
    }
    
    for( int i = 2; i <= n; i++ )
        d[i] = INF;
}

void B()
{
    Q.push(1);
    
    int k;
    
    while( !Q.empty() )
    {
        k = Q.front();
        for( int i = 0; i < G[k].size(); ++i)
            if( d[ G[k][i].first ] > d[k] + G[k][i].second )
            {
                d[ G[k][i].first ] = d[k] + G[k][i].second;
                Q.push( G[k][i].first );
            }
        Q.pop();
    }
}

void Write()
{
    for( int i = 2; i <= n; i++ )
        if( d[i] == INF )
            fout << 0 << ' ';
        else
            fout << d[i] << ' ';   
}