#include <fstream>
#include <queue>
#include <vector>
#define inf 1e9
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m;
vector<pair<int,int>> g[50002];
int d[50002],viz[50002];
priority_queue<pair<int,int>> q;
void Dijkstra(int nod){
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[nod]=0;
    q.push({0,nod});
    while(!q.empty()){
        nod=q.top().second;
        q.pop();
        if(viz[nod]==0){
            for(auto it : g[nod]){
                int i=it.first;
                if(d[i]>d[nod]+it.second){
                    d[i]=d[nod]+it.second;
                    q.push({-d[i],i});
                }
            }
        }
    }
}
int main()
{
    cin>>n>>m;
    int a,b,c;
    for(int i=1;i<=m;i++){
        cin>>a>>b>>c;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    Dijkstra(1);
    for(int i=2;i<=n;i++) cout<<d[i]<<' ';
    return 0;
}