#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
typedef pair<int,int>ii;
typedef vector<int> vi;
typedef vector<ii> vii;

const int INF=1000000000;
const int NMAX=50000;
vector<ii> G[NMAX+5];
int n,m,s,u,v,w;
int main() {
    int i,j;
    in>>n>>m;
    s=1;
    for(i=1; i<=m; i++) {
        in>>u>>v>>w;
        G[u].push_back(ii(v,w));
    }
    vi dist(n+1,INF);dist[s]=0;
    priority_queue< ii,vector<ii>,greater<ii> > pq;
    pq.push(ii(0,s));
    while(!pq.empty()) {
        ii front = pq.top();
        pq.pop();
        int d=front.first,u=front.second;
        if(d>dist[u])
            continue;
        for(j=0; j<(int)G[u].size(); j++) {
            int v=G[u][j].first,duv=G[u][j].second;
            if(dist[u]+duv<dist[v]) {
                dist[v]=dist[u]+duv;
                pq.push(ii(dist[v],v));
            }
        }
    }
    for(i=2; i<=n; i++) {
        if(dist[i]==INF)
            dist[i]=0;
        out<<dist[i]<<" ";
    }

    return 0;
}