#include <fstream>
#include <climits>
using namespace std;
ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");

int a[1000][1000], x, y, c, n, m, cost[1000], pred[1000];

void citire()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        a[x][y]=c;
    }
}
void drumuri(int nodInitial)
{
    for(int i=1;i<=n;++i)
    {
        if(a[nodInitial][i]!=0)
        {
            if(cost[i]>a[nodInitial][i]+cost[nodInitial])
            {
                cost[i]=a[nodInitial][i]+cost[nodInitial];
                pred[i]=nodInitial;
            }
            drumuri(i);
        }
    }
}
int main()
{
    citire();
    for(int i=1;i<=n;++i) cost[i]=INT_MAX;
    cost[1]=0;
    drumuri(1);
    for(int i=2;i<=n;++i) g<<cost[i]<<" ";
    return 0;
}