#include <bits/stdc++.h>
#define NN 50000
#define INF 1000000005
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

int n, m, vis[NN], d[NN];
int a, b, c;
int dmin, vfmin, vf, dis;
vector <pair<int, int> > v[NN];
set <pair<int, int> > s;

int main()
{
    fin >> n >> m;
    for(int i = 1 ; i <= m ; i++)
    {
        fin >> a >> b >> c;
        v[a].push_back({b, c});
    }

    for(int i = 1 ; i <= n ; i++)
    {
        d[i] = INF;
    }

    s.insert({0, 1});
    d[1] = 0;
    while(!s.empty())
    {
        pair<int, int> elem = *s.begin();
        s.erase(elem);
        int dmin = elem.first;
        int vfmin = elem.second;
        vis[vfmin] = 1;
        for(int i = 0 ; i < v[vfmin].size() ; i++)
        {
            elem = v[vfmin][i];
            vf = elem.first;
            dis = elem.second;
            if(vis[vf] == 0 && d[vf] > dmin + dis)
            {
                s.erase({d[vf], vf});
                d[vf] = dmin + dis;
                s.insert({d[vf], vf});
            }
        }
    }

    for(int i = 2 ; i <= n ; i++)
    {
        if(d[i] == INF)
            d[i] = 0;
        fout << d[i] << " ";
    }
    return 0;
}