#include <bits/stdc++.h>
using namespace std;
vector< pair<int,int> >edge[100005];
int dist[100005];
void dfs(int nod)
{
    for(auto it:edge[nod])
    {
        if(dist[it.first] > dist[nod]+ it.second)
        {
            dist[it.first]=dist[nod]+it.second;
            dfs(it.first);
        }
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int m ,n,i,j,k,a,b,cnt=0;
    cin>>n>>m;
    vector<int>v;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b>>k;
        edge[a].push_back({b,k});
        edge[b].push_back({a,k});
    }
    memset(dist,1000005,sizeof(dist));
    dist[1]=0;
    dfs(1);
    for(i=2;i<=n;i++)
        cout<<dist[i] <<" ";
    return 0;
}