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

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

int n, m;
vector<vector<pair<int,int> > > g;
vector<int> d;
set<pair<int, int> > t;

void READ();
void SOLVE();
void WRITE();

int main()
{
    READ();
    SOLVE();
    WRITE();
    is.close();
    os.close();
    return 0;
}

void READ()
{
    is >> n >> m;
    g.resize(n + 1);
    d.resize(n + 1, INF);
    d[1] = 0;
    int x, y, z;
    for ( int i = 1; i <= m; ++i )
    {
        is >> x >> y >> z;
        g[x].push_back(make_pair(z, y));
    }
}

void SOLVE()
{
    int nod;
    t.insert(make_pair(0, 1));
    while ( !t.empty() )
    {
        nod = t.begin()->second;
        t.erase(t.begin());
        for ( vector<pair<int, int> >::iterator it = g[nod].begin(); it != g[nod].end(); ++it )
            if ( d[it->second] > d[nod] + it->first )
            {
                d[it->second] = d[nod] + it->first;
                t.insert(make_pair(d[it->second], it->second));
            }
    }
}

void WRITE()
{
    for ( int i = 2; i <= n; ++i )
        os << d[i] << " ";
}