#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

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

const int NMAX = 50005;

int dist[NMAX];
vector < vector < pair <int,int> > > adjList;
priority_queue < pair <int,int> , vector < pair <int,int> >, greater < pair <int,int> > > pq;

int main()
{
    int n,m;
    fin>>n>>m;
    adjList.resize(n + 1);
    int x,y,z;
    for(int i = 1;i <= m;i++)
    {
        fin>>x>>y>>z;
        adjList[x].push_back({z,y});
        adjList[y].push_back({z,x});
        dist[i] = INT_MAX;
    }
    for(auto u : adjList[1]){
        dist[u.second] = u.first;
        pq.push(u);
    }
    while(!pq.empty()){
        pair <int,int> cand = pq.top();
        pq.pop();
        for(auto u : adjList[cand.second]){
            if(u.first + dist[cand.second] < dist[u.second]){
                dist[u.second] = u.first + dist[cand.second];
                pq.push(u);
            }
        }
    }
    for(int i = 2;i <= n;i++)
        fout<<dist[i]<< " ";
    return 0;
}