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

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

const int Dim = 50002, Inf = 0x3f3f3f3f;

int n, m, d[Dim];
vector<vector<pair<int, int> > > G;
typedef vector<pair<int, int> >::iterator IT;

set<pair<int, int> > T;

void Solve(void)
{
    int i, x;

    for(i = 2; i <= n; i++) d[i] = Inf;
    T.insert({0, 1});
    int y, dx, cost;
    while ( !T.empty() )
    {
        dx = T.begin()->first, x = T.begin()->second;
        T.erase(T.begin());
        if ( dx > d[x] )
            continue;
        for(auto p : G[x] )
        {
            y = p.first;
            cost = p.second;
            if(d[y] > dx + cost )
            {
                d[y] = dx + cost,
                T.insert({d[y], y});
            }
        }
    }
}

int main()
{


    int i, a, b, c;

    fin >> n >> m;
    G.resize(n + 1);
    for(i = 1; i <= m; i++)
    {
        fin >> a >> b >> c;
        G[a].push_back({b, c});
    }

    Solve();

    for(i = 2; i <= n; i++)
    {
        if ( d[i] == Inf )
            fout << 0 << ' ';
        else
            fout << d[i] << ' ';
    }

    return 0;
}