#include <bits/stdc++.h>
using namespace std;

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

vector<pair<int, int>> L[50005];
bitset<50005> viz;
int d[50005];
priority_queue<pair<int, int>> q;
int n, m;

void Dijkstra(int k)
{
    int i, x;
    d[k] = 0;
    q.push({0, k});
    while(!q.empty())
    {
        k = q.top().second;
        q.pop();
        if(viz[k] == 0)
        {
            viz[k] = 1;
            for(auto w : L[k])
            {
                int dis = w.first;
                int nod = w.second;
                if(d[nod] > d[k] + dis)
                {
                    d[nod] = d[k] + dis;
                    q.push({-d[nod], nod});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i] == 2e9) fout << "0 ";
        else fout << d[i] << " ";
}

int main()
{
    int i, c, x, y;
    fin >> n >> m;
    for(i=1;i<=m;i++)
    {
        fin >> x >> y >> c;
        L[x].push_back({c, y});
    }
    for(i=1;i<=n;i++)
        d[i] = 2e9;
    Dijkstra(1);
    fin.close();
    fout.close();
    return 0;
}