#include <fstream>
#include <queue>
#include <vector>
#include <map>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const long long inf = 2e18;

long long n, m, dist[50005];
vector<pair<int, int>> v[50005];
bool vzt[50005];

struct nod {
    int val;

    bool operator>(nod a) const {
        return dist[val] < dist[a.val];
    }
    bool operator<(nod a) const {
        return dist[val] > dist[a.val];
    }
    bool operator==(nod a) const {
        return dist[val] == dist[a.val];
    }
};

priority_queue<nod> que;

int main()
{
    in >> n >> m;
    for(int i=1; i<=m; i++) {
        int x, y, lg;
        in >> x >> y >> lg;
        v[x].push_back({y, lg});
    }
    for(int i=2; i<=n; i++)
        dist[i] = inf;

    que.push({1});
    while(!que.empty()) {
        int pos = que.top().val;
        que.pop();
        if(vzt[pos])
            continue;

        for(int i=0; i<v[pos].size(); i++) {
            if(dist[v[pos][i].first] > dist[pos] + v[pos][i].second) {
                dist[v[pos][i].first] = dist[pos] + v[pos][i].second;
                que.push({v[pos][i].first});
            }
        }
        vzt[pos] = 1;
    }

    for(int i=2; i<=n; i++)
        if(dist[i] != inf)
            out << dist[i] << ' ';
        else out << "0 ";
    return 0;
}