#include <bits/stdc++.h>

using namespace std;

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second

#define NMAX 100005
#define MOD 1000000007
#define INF 0x3f3f3f3f

vector<vector<pii>> graf(NMAX);
int n, ans, dist[NMAX];

void read()
{
    int x, y, wt, m;
    in >> n >> m;
    while (m--)
        in >> x >> y >> wt, graf[x].emplace_back(y, wt);
}

void Dijkstra(int start)
{
    memset(dist, INF, sizeof dist);

    dist[start] = 0;
    priority_queue<pii> pq;
    pq.push({0, start});

    while (!pq.empty())
    {
        int u, cost;
        tie(cost, u) = pq.top();
        pq.pop();

        for (auto node : graf[u])
        {
            int v = node.fi, currcost = node.se;
            if (cost + currcost < dist[v])
                dist[v] = cost + currcost, pq.push({dist[v], v});
        }
    }
}

void solve()
{
    Dijkstra(1);
    for (int i = 2; i <= n; i++)
        out << (dist[i] == INF ? 0 : dist[i]) << ' ';
}

int main()
{
    read();
    solve();
    return 0;
}