#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct ceva
{
    int nod,cost;
    bool operator < (const ceva& x)const
    {
        return cost>x.cost;
    }
};
vector<ceva>v[50001];
int d[50001];
int viz[50001];
int n,m,i;
priority_queue<ceva>pq;
int x;
int lg;
ceva p;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        v[a].push_back({b,c});
        v[b].push_back({a,c});
    }
    for(i=2; i<=n; i++)
    {
        d[i]=2e9;
    }
    pq.push({1,0});
    while(!pq.empty())
    {
        p=pq.top();
        pq.pop();
        if(viz[p.nod])
            continue;
        viz[p.nod]=1;
        for(auto vecin:v[p.nod])
        {
            if(d[vecin.nod]>d[p.nod]+vecin.cost)
            {
                d[vecin.nod]=d[p.nod]+vecin.cost;
                pq.push({vecin.nod,d[vecin.nod]});
            }
        }
    }
    for(i=2; i<=n; i++)
        if(d[i]==2e9)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    return 0;
}