#include <bits/stdc++.h>
#define oo 2000000000

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, d[50005];
bool viz[50005];
vector< pair<int, int> > L[50005];
priority_queue< pair<int, int> >q;
void Dijkstra()
{
    int x, nod, cost;
    for(int i = 1;i <= n;i++)
        d[i] = oo;
    d[1] = 0;
    q.push({0, 1});
    while(!q.empty())
    {
        x = q.top().second;
        q.pop();
        if(viz[x] == 0)
        {
            viz[x] = 1;
            for(auto e : L[x])
            {
                nod = e.first;
                cost = e.second;
                if(d[nod] > d[x] + cost)
                {
                    d[nod] = d[x] + cost;
                    q.push({-d[nod], nod});
                }
            }
        }
    }
}

int main()
{
    int i, j, cost;
    fin >> n >> m;
    while(m)
    {
        fin >> i >> j >> cost;
        L[i].push_back({j, cost});
        m--;
    }
    Dijkstra();
    for(i = 2;i <= n;i++)
        fout << d[i] << " ";
    fout << "\n";
    fout.close();
    return 0;
}