#include <bits/stdc++.h>
#define MAXN 50005
#define INF 2000000000

using namespace std;

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

int v[MAXN], n, m, x, y, z;
vector <pair <int, int> > g[MAXN];
bitset <MAXN> inqueue;

struct compare
{
    bool operator() (int d1, int d2)
    {
        return v[d1]>v[d2];
    }
};

priority_queue <int, vector<int>, compare> pq;

void dijkstra(int node)
{
    for (int i=1; i<=n; i++)
        v[i]=INF;
    v[node]=0;
    inqueue[node]=1;
    pq.push(node);
    while (!pq.empty())
    {
        int nod=pq.top();
        inqueue[nod]=0;
        pq.pop();
        for (int i=0; i<g[nod].size(); i++)
        {
            int vecin, cost;
            vecin=g[nod][i].first;
            cost=g[nod][i].second;
            if (v[nod]+cost<v[vecin])
            {
                v[vecin]=v[nod]+cost;
                if (!inqueue[vecin])
                {
                    inqueue[vecin]=1;
                    pq.push(vecin);
                }
            }
        }
    }
}

int main()
{
    in >> n >> m;
    for (int i=1; i<=m; i++)
    {
        in >> x >> y >> z;
        g[x].push_back(make_pair(y,z));
    }
    dijkstra(1);
    for (int i=2; i<=n; i++)
        if (v[i]==INF)
            out << 0 << " ";
        else
            out << v[i] << " ";
    return 0;
}