#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f
using namespace std;
ifstream is ("dijkstra.in");
ofstream os ("dijkstra.out");

vector < pair<int, int> > V[50001];
priority_queue <pair <int, int>, vector<pair <int, int> >, greater <pair <int, int> > > Q;
vector <int> d;
int n, m;
void Read();
void DIJKSTRA();

int main()
{
    Read();
    DIJKSTRA();
    for(int i = 2; i <= n; ++i)
    {
        if(d[i] == INF)
            os << 0 << ' ';
        else
            os << d[i] << ' ';
    }
    return 0;
}
void Read()
{
    int x, y, z;
    is >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        is >> x >> y >> z;
        V[x].push_back(make_pair(y, z));
    }
    Q.push(make_pair(0, 1));
    d.resize(n+1, INF);
    d[1] = 0;
}
void DIJKSTRA()
{
    int nod, x;
    while(!Q.empty())
    {
        nod = Q.top().second;
        x = Q.top().first;
        Q.pop();
        for(unsigned i = 0; i < V[nod].size(); ++i)
            if(d[V[nod][i].first] > x + V[nod][i].second)
            {
                d[V[nod][i].first] = x + V[nod][i].second;
                Q.push(make_pair(d[V[nod][i].first], V[nod][i].first));
            }

    }
}