#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define NMAX 50002

using namespace std;

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

int D[NMAX],N,M;

class cmp
{
    public:
    inline bool operator()(const int&a,const int&b){return D[a]>D[b];}
};

vector<pair<int,int> > V[NMAX];
priority_queue<int,vector<int>,cmp> Heap;

bitset<NMAX> In_Heap;

int main()
{
    int x,y,c,i;

    in>>N>>M;
    for(x=1;x<=N;x++)D[x] = NMAX;
    while(M--)
    {
        in>>x>>y>>c;
        V[x].push_back(make_pair(y,c));
        V[y].push_back(make_pair(x,c));
    }
    //plec din nodul 1
    D[1] = 0;
    for(Heap.push(1);!Heap.empty();Heap.pop())
    {
        x = Heap.top();
        for(i=0;i<V[x].size();i++)
        {
            y = V[x][i].first;
            c = V[x][i].second;
            if(D[y]>D[x]+c)
            {
                D[y] = D[x]+c;
                if(!In_Heap[y])
                    Heap.push(y),In_Heap[y] = 1;
            }
        }
    }
    for(x=2;x<=N;x++)out<<(D[x]==NMAX?0:D[x])<<' ';
    return 0;
}