#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;

#define file "dijkstra"

using VI = vector<int>;
using VVI = vector<VI>;
using VP = vector<pair<int, int>>;
using VVP = vector<VP>;

int n, m;
VI d;
VVP g;

void read()
{
    int x, y, z;
    ifstream is(file".in", ios::in);

    is >> n >> m;
    g = VVP(n + 1);

    for (int i = 1; i <= m; ++i)
    {
        is >> x >> y >> z;
        g[x].push_back(make_pair(z, y));
        g[y].push_back(make_pair(z, x));
    }
    is.close();
}

void solve()
{
    priority_queue<pair<int, int>, VP, greater<pair<int,int>>> q;
    int x, z;

    q.push(make_pair(0, 1));
    d = VI(n + 1, INF);
    d[1] = 0;

    while (!q.empty())
    {
        x = q.top().second;
        z = q.top().first;
        q.pop();
        if (z > d[x])
            continue;
        for (const auto& y : g[x])
            if (d[y.second] > d[x] + y.first)
            {
                d[y.second] = d[x] + y.first;
                q.push(make_pair(d[y.second], y.second));
            }
    }
}

void write()
{
    ofstream os(file".out", ios::out | ios::trunc);
    for_each(d.begin() + 2, d.end(), [&os](int q){ q == INF ? os << "0 " : os << q << " ";});
    os.close();
}

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