#include <bits/stdc++.h>
#define NMAX 50010
#define LL long long
#define oo 9999999999
#define mp make_pair

using namespace std;

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

LL dist[NMAX];
int n, m, x, y, w;
vector<pair<LL, int> > v[NMAX]; /// (nod, distanta pe muchie pana la nod)
bitset<NMAX> in_set; ///spune daca a nodul a fost vizitat sau nu
set<pair<LL, int> > currentSet; /// (distanta pana la nod, nod)
set<pair<LL, int> >::iterator top;

int main()
{
    LL dst;
    int nod;
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> w;
        v[x].push_back(mp(w,y));
    }
    for(int i=1; i<=n; i++)
        dist[i] = oo;
    dist[1] = 0;
    currentSet.insert(mp(0, 1));
    in_set[1] = 1;
    while(!currentSet.empty())
    {
        top = currentSet.begin();
        currentSet.erase(top);
        in_set[top->second] = 0;
        nod = top->second;
        dst = top->first;
        for(auto vec:v[nod])
        {
            if(!in_set[vec.second])
            {
                ///nu sunt in set, ii adaug in set
                currentSet.insert(mp(dst + vec.first, vec.second));
                dist[vec.second] = dst + vec.first;
                in_set[vec.second] = 1;
            }
            else
            {
                ///exista deja in set nodul vec.second
                ///daca ii dam update
                if(dst + vec.first < dist[vec.second])
                {
                    currentSet.erase(currentSet.find(mp(dist[vec.second], vec.second)));
                    currentSet.insert(mp(dst + vec.first, vec.second));
                    dist[vec.second] = dst + vec.first;
                }
            }
        }
    }
    for(int i=2; i<=n; i++){
        if(dist[i] != oo)
            fout << dist[i] << ' ';
        else
            fout << 0 << ' ';
    }
    fout << '\n';


    return 0;
}