#include <bits/stdc++.h>

#define pii pair <int, int>
#define f first
#define s second
#define mp make_pair

using namespace std;

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

const int nMax = 50010;

vector <pii> v[nMax];
vector <int> ans;

void dij(int source)
{
    priority_queue <pii, vector <pii>, greater<pii> > pq;

    pq.push(mp(0, source));

    while(!pq.empty())
    {
        pii x = pq.top(); pq.pop();
        int dist = x.f, nod = x.s;

        if(ans[nod] != -1) continue;

        ans[nod] = dist;
        for(auto it : v[nod])
            if(ans[it.s] == -1)
                pq.push(mp(dist + it.f, it.s));
    }
}

int main()
{
    int n, m; fin >> n >> m;
    ans.assign(n, -1);
    for(int i=0; i<m; i++)
    {
        int x, y, z; fin >> x >> y >> z; x--; y--;
        v[x].push_back(mp(z, y));
    }

    dij(0);

    for(int i=1; i<n; i++) fout << max(0, ans[i]) << " ";
    return 0;
}