#include <fstream>
#include <vector>
#include <set>
#define INF 0x3f3f3f3f
using namespace std;

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

using VI = vector<int>;
using VVII = vector<vector<pair<int, int>>>;

int n, m;
VI d, ok;
VVII g;
set<pair<int, int>> s;

int main()
{
    is >> n >> m;
    g = VVII(n + 1);
    int x, y, z;
    while ( m-- )
    {
        is >> x >> y >> z;
        g[x].push_back(make_pair(z, y));
    }
    ok = VI(n + 1);
    d = VI(n + 1, INF);
    d[1] = 0;
    s.insert(make_pair(0, 1));
    int nod;
    while ( s.size() )
    {
        nod = s.begin()->second;
        s.erase(s.begin());
        for ( const auto &nodv : g[nod] )
        {
            if ( d[nodv.second] > d[nod] + nodv.first )
            {
                d[nodv.second] = d[nod] + nodv.first;
                s.insert(make_pair(d[nodv.second], nodv.second));
            }
        }
    }
    for ( int i = 2; i <= n; ++i )
        os << ( d[i] == INF ? 0 : d[i] ) << " ";
    is.close();
    os.close();
    return 0;
}