#include <fstream>
#include <vector>
#include <limits>
#include <set>
using namespace std;

const int INF = numeric_limits<int>::max();

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

int n, m;
int a, b, c;
vector<vector<pair<int,int>>> ad;


int main()
{
    fin >> n >> m;
    ad.resize(n + 1);
    for (int i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        ad[a].push_back(make_pair(b,c));
        ad[b].push_back(make_pair(a, c));
    }
    vector<int> dist(n+1, INF);
    set<pair<int, int>> pq;
    dist[1] = 0;
    pq.insert({ 0,1 });
    while (!pq.empty())
    {
        pair<int, int> min1;
        min1 = *pq.begin();
        pq.erase(pq.begin());
        int u = min1.second;
        for (size_t i=0;i< ad[u].size();i++)
        {
            int v = ad[u][i].first;
            int g = ad[u][i].second;
            if (dist[u] + g < dist[v])
            {
                pq.erase({ dist[v],v });
                dist[v] = dist[u] + g;
                pq.insert({ dist[v], v });
            }
        }
    }
    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INF)
            fout << 0 << " ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}