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

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];
vector<pair<int,int> >::iterator it,sf;
priority_queue<int,vector<int>,cmp> Heap;

bool In_Heap[NMAX];

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

    in>>N>>M;

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