#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

#define INF 1<<23
#define nod first
#define cost second

int N, M, D[50003];
vector <pair<int,int> > V[50003];

struct COMP{
    bool operator ()(int A, int B)
    {
        return D[A]<D[B];
    }
};

priority_queue <int, vector <int> , COMP> Q;

int main()
{
    is >> N >> M;
    int a, b, c;
    for (int i = 1; i <= M; ++i)
    {
        is >> a >> b >> c;
        V[a].push_back(make_pair(b, c));
    }
    for (int i = 2; i <= N; ++i) D[i] = INF;
    Q.push(1);
    pair <int, int> k;
    for (int i; !Q.empty();)
    {
        i = Q.top(); Q.pop();
        for (int j = 0; j < V[i].size(); ++j)
        {
            k = V[i][j];
            if (D[k.nod] > D[i] + k.cost)
            {
                D[k.nod] = D[i] + k.cost;
                Q.push(k.nod);
            }
        }
    }
    for (int i = 2; i <= N; ++i)
        os << D[i] << ' ';
    is.close();
    os.close();
}