#include <fstream>
#include <queue>
#include <vector>
#define inf 200000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

typedef pair< int, int > edge;
int N, M, x, y, c, D[50005];
vector < edge > G[50005];
struct cmp
{
    bool operator()(const int &A, const int &B)const
    { return (D[A]>D[B]); }
};
priority_queue< int, vector<int>, cmp> Q;

void dijkstra(int sursa)
{
    for (int i=1; i<=N; ++i) D[i]=inf;
    Q.push(sursa); D[sursa]=0;
    while (Q.size())
    {
        int nod=Q.top(); Q.pop();
        vector <edge>::iterator it=G[nod].begin();
        for (; it!=G[nod].end(); ++it)
            if ( D[it->first]>D[nod]+it->second )
                D[it->first]=D[nod]+it->second, Q.push(it->first);
    }
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>x>>y>>c, G[x].push_back(edge(y, c));
    dijkstra(1);
    for (int i=2; i<=N; ++i)
        if (D[i]!=inf) g<<D[i]<<' ';
            else g<<0<<' ';
    return 0;
}