#include <fstream>
using namespace std;
#define INF 1000000000
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int tata[50001], c[5001][5001], viz[5001], d[5001];
void read(int &n, int &m)
{
    f >> n >> m;
    for(int i = 1; i<=m; i++)
    {
        int x, y, cost;
        f >> x >> y >> cost;
        c[x][y] = cost;
    }
    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=n; j++)
            if(!c[i][j])
            c[i][j] = INF;
}
void dijkstra(int x0, int n)
{
    for(int i = 1; i<=n; i++)
    {
        d[i] = c[x0][i];
        tata[i] = x0;
        viz[i] = 0;
    }
    tata[x0] = 0;
    viz[x0] = 1; int ok = 1, k;
    while(ok)
    {
       int min1 = INF;
        for(int i = 1; i<=n; i++)
        if(!viz[i] && min1 > d[i]) {
            min1 = d[i];
            k = i;
        }
        if(min1 != INF)
        {
            viz[k] = 1;
            for(int i = 1; i<=n; i++)
                if(!viz[i] && d[i] > d[k] + c[k][i])
            {
                d[i] = d[k] + c[k][i];
                tata[i] = k;
            }
        }
        else ok = 0;
    }
}
int main()
{
    int n, m;
    read(n, m);
    dijkstra(1, n);
    for(int i = 1; i<=n; i++)
        if(d[i] != INF)
        g << d[i] << ' ';
    return 0;
}