#include <bits/stdc++.h>
#define Dim 50005
#define oo 1<<30
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int N,M,a,b,c,D[Dim];
bool viz[Dim];

struct cmp
{
    bool operator()(int x, int y)
    {
        if(D[x]>D[y]) return 1;
        else return 0;
    }
};

vector < pair<int,int> > V[Dim];
priority_queue < int,vector<int>,cmp > minheap;

void Dijkstra()
{
    for(int i=1;i<=N;i++) D[i]=oo;
    D[1]=0;
    minheap.push(1);
    while(!minheap.empty())
    {
        int nod=minheap.top();
        minheap.pop();
        viz[nod]=1;
        for(unsigned int i=0;i<V[nod].size();i++)
        {
            int vecin=V[nod][i].first;
            int cost=V[nod][i].second;
            if(D[nod]+cost<D[vecin])
            {
                D[vecin]=D[nod]+cost;
                if(!viz[vecin])
                {
                    minheap.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}

int main()
{
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>a>>b>>c;
        V[a].push_back({b,c});
        V[b].push_back({a,c});
    }

    Dijkstra();

    for(int i=2;i<=N;i++)
    if(D[i]==oo) g<<0<<" ";
    else g<<D[i]<<" ";

    return 0;
}