# include <cstdio>
# define INF (1<<30)
# define N (1<<10)

using namespace std;

int n,m,i,j,x,y,c;
int a[N][N], d[N];
bool sel[N];

void load()
{
    freopen("dijkstra.in","r",stdin);

    scanf("%d%d",&n,&m);
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            if (i==j) a[i][j]=0;
            else a[i][j]=INF;
        }
    }
    for(i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        a[x][y]=c;
    }

    fclose(stdin);
    return;
}

void solve (int n, int p)
{
    int i, j, k=j, Min;
    for(i=1; i<=n; i++) d[i]=INF; d[p]=0;
    for(i=1; i<=n; i++)
    {
        Min=INF;

        for (j=1; j<=n; j++)
            if (Min>d[j] && !sel[j])
            {
                Min=d[j];
                k=j;
            }

        sel[k]=true;

        for(j=1; j<=n; j++)
            if(d[j]>d[k]+a[k][j] && !sel[j])
                d[j]=d[k]+a[k][j];
    }

    return;
}

void write()
{
    freopen("dijkstra.out","w",stdout);

    int i;
    for(i=2; i<=n; i++)
    {
        if(d[i]!=INF) printf("%d ",d[i]);
        else printf("0 ");
    }

    fclose(stdout);
    return;
}

int main()
{
    load();
    solve(n,1);
    write();
    return 0;
}