#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 50005;
int n, m;
vector <pair <int, int> > g[nmax];
int viz[nmax];

inline void read()
{
    fin >> n >> m;
    while (m--)
    {
        int a, b, c1;
        fin >> a >> b >> c1;
        g[a].push_back({b, c1});
    }
}

int d[nmax];

struct cmp
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};

priority_queue <int, vector<int>, cmp> q;

inline void dij()
{
    for (int i = 1; i <= n; i++)
        d[i] = 1e9;
    d[1] = 0;
    q.push(1);
    while (!q.empty())
    {
        int nod = q.top();
        q.pop();
        viz[nod] = 0;
        for (unsigned int i = 0; i < g[nod].size(); i++)
        {
            int vecin  = g[nod][i].first;
            int cost = g[nod][i].second;
            if (d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                if (!viz[vecin])
                {
                    viz[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
    for (int i = 2; i <= n; i++)
        if (d[i] == 1e9)
            fout << "0 ";
        else
            fout << d[i] << " ";
}

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