#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int dmin[50005];

struct el
{
    int nod, cost;
    bool operator < (const el &A) const ///retin ca am de doua ori const (mai mult decat constanta hehe:)
    {
        return cost > A.cost;
    }
};

priority_queue < el > Q;

vector < el > L[50005];

void read()
{
    int x;
    el y;
    fin >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        fin >> x;
        fin >> y.nod >> y.cost;
        L[x].push_back(y);
    }
}

void dijkstra()
{
    el ba;
    ba.nod = 1;
    ba.cost = 0;
    Q.push(ba);

    while(!Q.empty())
    {
        el baba = Q.top();
        Q.pop();
        for(int i = 0; i < L[baba.nod].size(); i ++) ///i-ul meu merge pe el, nu pe int de fapt
        {
            int nodi = L[baba.nod][i].nod;
            int cost_cur = L[baba.nod][i].cost + dmin[baba.nod];
            if(dmin[nodi] > cost_cur)
            {
                dmin[nodi] = cost_cur;
                el BaBa;
                BaBa.nod = nodi;
                BaBa.cost = cost_cur;
                Q.push(BaBa); ///bag in coada cu costul total pana la nodul i, nu doar cu costul initial al muchiei
            }
        }
    }
}

int main()
{
    read();
    for(int i = 2; i <= n; i ++)
        dmin[i] = 1e9;

    //stiu ca sursa imi e 1
    dijkstra();
    for(int i = 2; i <= n; i ++)
        if(dmin[i] != 1e9)
            fout << dmin[i] << " ";
        else fout << 0 << " ";

    return 0;
}