#include <cstdio>
#include <vector>
#include <queue>

using namespace std;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int INF=1000000000;
const int NMAX=50005;
vii G[NMAX+5];
int main() {
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n,m,u,v,w,i,j;
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; i++) {
        scanf("%d%d%d",&u,&v,&w);
        G[u].push_back(ii(v,w));
    }
    vi dist(n+1,INF);
    dist[1]=0;
    priority_queue<ii,vector<ii>,greater<ii> >pq;
    pq.push(ii(0,1));
    while(!pq.empty()) {
        ii front1=pq.top();
        pq.pop();
        int d=front1.first,u=front1.second;
        if(d>dist[u])
            continue ;
        for(j=0; j<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)
            printf("%d ",dist[i]);
        else
            printf("0 ");
    return 0;
}