#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define INF 2100000000
using namespace std;
using pii = pair<int, int>;
//using INF = 2100000000;
struct edge
{
    int fin;
    int cost;
};
bool cmp(pii a, pii b)
{
    return a.first<b.first;
}
vector<pii>gagii[50005];
priority_queue<pii, vector<pii>, greater<pii>>pq; //first weight, second index
int dist[50005]; ///distanta maxima
void dijkstra (int n)
{
    while (pq.empty()==false)
    {
        pii u = pq.top();
        //cout<<u.first<<" "<<u.second<<'\n';
        pq.pop();
        for (auto i : gagii[u.second])
        {
            if (dist[i.second]>dist[u.second]+i.first)
            {
                dist[i.second]=dist[u.second]+i.first;
                pq.push(make_pair(dist[i.second], i.second));
            }
        }
    }
    for (int i=2; i<=n; i++)
    {
        cout<<dist[i]<<" ";
    }
    return;
}
int main()
{
    ifstream cin ("dijkstra.in");
    ofstream cout ("dijkstra.out");
    int n, m, a, b, c;
    cin>>n>>m;
    for (int i=2; i<=n; i++){dist[i]=INF;}
    for (int i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        pii e;
        e.first=c;
        e.second=b;
        gagii[a].push_back(e);
        e.second=a;
        gagii[b].push_back(e);
    }
    pq.push(make_pair(0, 1));
    dijkstra(n);
}