#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define nmax 50005
#define in "dijkstra.in"
#define out "dijkstra.out"
#define inf 123456789
using namespace std;

vector< pair<int,int> > gf[nmax];
queue<int> Q;
int n, m, d[nmax], viz[nmax];


void dijkstra(){
    memset(d, inf, sizeof(d));
    memset(viz, 0, sizeof(viz));
    viz[1]=1;
    d[1]=0;

    for(Q.push(1);!Q.empty();Q.pop()){
        int nod = Q.front();
        viz[nod]=0;
        for(vector< pair<int,int> >:: iterator it=gf[nod].begin(); it!=gf[nod].end(); it++){
            int y = it->first;
            int c = it->second;
            if (d[y] > d[nod] + c){
                d[y] = d[nod] + c;
                if (viz[y]==0){
                    Q.push(y);
                    viz[y]=1;
                }
            }
        }
    }
}

int main(){

    freopen(in, "r", stdin);
    freopen(out, "w", stdout);
    scanf("%d %d\n", &n, &m);

    for(int i=1; i<=m; i++){
        int x, y, c;
        scanf("%d %d %d\n", &x, &y, &c);
        gf[x].push_back(make_pair(y,c));
    }
    dijkstra();

    for(int i=2; i<=n; i++)
        if (d[i]>inf) printf("0 ");
        else printf("%d ",d[i]);

    return 0;
}