#include <fstream>
//#include <cstdio>
//ATENTIE LA CITIRE!!!
#include <vector>
#include <cstring>
#include <queue>
#define nmax 50001
#define infile "dijkstra.in"
#define outfile "dijkstra.out"
#define inf 0x3f3f3f3f

using namespace std;

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

void dijkstra(int sursa){
    memset(d,inf,sizeof(d));//initializeaza vectorul d cu valoare inf pe toata lungimea lui;
    //for(int i=1; i<=n; i++) d[i]=12345679;
    d[sursa]=0;
    viz[sursa]=1;
    for(Q.push(sursa);!Q.empty();Q.pop()){
        int nod = Q.front();
        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(){

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

    int sursa = 1;

    dijkstra(sursa);

    for(int i=2; i<=n; i++) out<<(d[i] < inf ? d[i] : 0)<<" ";

    in.close();
    out.close();
    return 0;
}