#include <fstream>
#include <utility>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

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

vector <vector <pair <int, int>>> a;
priority_queue <pair <int, long long>> que;
bitset <100005> v;

long long d[100005];

int n, m, p;

int main()
{
    cin >> n >> m;

    p = 1;

    a.resize(n + 2);

    for(int i = 1; i <= m; i++)
    {
        int x, y, c;

        cin >> x >> y >> c;

        a[x].push_back(make_pair(y, c));
        a[y].push_back(make_pair(x, c));
    }

    for(int i = 1; i <= n; i++)
        d[i] = 1e16;

    d[p] = 0;

    que.push(make_pair(p, 0));

    while(!que.empty())
    {
        int x = que.top().first;
        que.pop();

        while(!que.empty() and v[x] == 1)
        {
            x = que.top().first;
            que.pop();
        }

        v[x] = 1;

        for(int i = 0; i < a[x].size(); i++)
        {
            if(1LL * a[x][i].second + d[x] < d[a[x][i].first])
            {
                d[a[x][i].first] = 1LL * a[x][i].second + d[x];
                que.push(make_pair(a[x][i].first, -d[a[x][i].first]));
            }
        }
    }

    for(int i = 1; i <= n; i++)
        if(i != p)
        {
            if(d[i] != 1e16)
                cout << d[i] << " ";
            else
                cout << "0 ";
        }

    cout << '\n';

    return 0;
}