#include <iostream>
#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, i, j, x1, y, sum, c, dist[50005];
bool viz[50005];
struct nod
{
    int nod, cost;
}x;
struct comparecost
{
    bool operator()(const nod &a, const nod &b)
    {
        return a.cost>b.cost;
    }
};
vector <nod> v[50005];
priority_queue <nod, vector<nod>, comparecost> q;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x1>>y>>c;
        v[x1].push_back({y, c});
        v[y].push_back({x1, c});
    }
    for(i=1; i<=n; i++)
        dist[i]=1e9;
    dist[1]=0;
    q.push({1, 0});
    while(!q.empty())
    {
        x=q.top();
        q.pop();
        if(!viz[x.nod])
        for(auto i: v[x.nod])
            if(dist[i.nod]>dist[x.nod]+i.cost)
            {
                dist[i.nod]=dist[x.nod]+i.cost;
                q.push({i.nod, dist[i.nod]});
            }
        viz[x.nod]=1;

    }
    for(i=2; i<=n; i++)
        if(dist[i]==1e9)
        fout<<0<<" ";
    else
        fout<<dist[i]<<" ";
    return 0;
}