#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int INF = 1e18;
int n,m;
bitset<50001>vap;
long long dist[50001];
vector<pair<int,int>>v[50001];

void dijkstra(int nod)
{
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
    for(int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[nod] = 0;
    pq.push({0,nod});
    while(!pq.empty())
    {
        auto curr = pq.top();
        pq.pop();
        for(pair<int,int>i : v[curr.second])
        {
            int nod_urm = i.first;
            int cost_urm = i.second;

            if(dist[curr.second] + cost_urm < dist[nod_urm])
            {
                dist[nod_urm] = dist[curr.second] + cost_urm;
                pq.push({dist[nod_urm],nod_urm});
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int st,dr,c;
        fin >> st >> dr >> c;
        v[st].push_back({dr,c});
        v[dr].push_back({st,c});
    }
    dijkstra(1);
    for(int i = 2; i <= n; i++)
        fout << dist[i] << ' ';
    return 0;
}