#include <fstream>
#define INF 2000000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,i,j,c[2001][2001],x,y,cost,d[2001],s,k,mini,u[2001];
int main()
{
    f>>n>>m;
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=m;j++)
        {
            if (i==j)
            {
                c[i][j]=0;
            }
            else
            {
                c[i][j]=INF;
            }
        }
    }
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        c[x][y]=cost;
    }
    for (i=1;i<=n;i++)
    {
        d[i]=INF;
    }
    d[1]=0;
    for (k=1;k<=n;k++)
    {
        mini=INF;
        for (i=1;i<=n;i++)
        {
            if (!u[i]&&d[i]<mini)
            {
                mini=d[i];
                x=i;
            }
        }
        if (mini==INF)break;
        u[x]=1;
        for (i=1;i<=n;i++)
        {
            if (d[x]+c[x][i]<d[i])
            {
                d[i]=d[x]+c[x][i];
            }
        }
    }
    for (i=2;i<=n;i++)
    {
        if (d[i]!=INF)
        {
            g<<d[i]<<" ";
        }
        else
        {
            g<<"0"<<" ";
        }
    }
    return 0;
}