#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int nmax = 50005;
vector <int> graf[nmax], cost[nmax];
queue <int> coada;
int n, m, x, y, c, d[nmax], nod, i;
bool viz[nmax];
int main()
{
    in >> n >> m;
    while(m--)
    {
        in >> x >> y >> c;
        graf[x].push_back(y);
        cost[x].push_back(c);
    }
    for(i=2; i<=n; i++) d[i]=1<<30;
    coada.push(1);
    viz[1]=1;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        viz[nod]=0;
        for(i=0; i<graf[nod].size(); i++)
            if(d[graf[nod][i]] > d[nod]+cost[nod][i])
            {
                d[graf[nod][i]] = d[nod]+cost[nod][i];
                if(!viz[graf[nod][i]])
                {
                    coada.push(graf[nod][i]);
                    viz[graf[nod][i]]=1;
                }
            }
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]!= 1<<30) out << d[i] << " ";
        else out << "0 ";
    }
    in.close();
    out.close();
    return 0;
}