#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

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

const int Max = 5e4 + 1;
const int Inf = 1 << 30;

int n, m;

vector <pair <int, int>> graf[Max];
vector <int> d(Max, Inf);
bitset <Max> v;
priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> q;

void read()
{
    int x, y, z;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y >> z;
        graf[x].push_back({y, z});
        graf[y].push_back({x, z});
    }
}

void print()
{
    for (int i = 2; i <= n; ++i)
        if (d[i] != Inf)
            fout << d[i] << " ";
        else
            fout << 0 << " ";
}

void dijkstra(int nod)
{
    q.push({0, nod});
    d[nod] = 0;
    while (!q.empty())
    {
        nod = q.top().second;
        q.pop();
        if (v[nod])
            continue;
        v[nod] = 1;
        for (auto i : graf[nod])
        {
            int cost = i.second;
            int vecin = i.first;
            if (d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                q.push({d[vecin], vecin});
            }
        }
    }
}

int main()
{
    read();
    dijkstra(1);
    print();

    fin.close();
    fout.close();
    return 0;
}