#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;

int n, i, m, x, y, c, d[100002];
vector<int>G[100002], C[100002];
queue<int>q;
int main ()
{

    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    scanf("%d%d", &n, &m);
    for (i=1; i<=m; i++){
        scanf("%d%d%d", &x, &y, &c);
        G[x].push_back(y);
        C[x].push_back(c);
    }

    memset(d, 1, sizeof(d));
    d[1]=0;
    q.push(1);
    while (!q.empty()){
        x=q.front();
        q.pop();
        for (i=0; i<G[x].size(); i++){
            if (d[G[x][i]]>d[x]+C[x][i]){
                d[G[x][i]]=d[x]+C[x][i];
                q.push(G[x][i]);
            }
        }
    }
    for (i=2; i<=n; i++){
        if (d[i]==d[0]) printf("0 ");
        else printf("%d ", d[i]);
    }
    return 0;
}