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

#define NMax 50005
#define INF 0x3f3f3f3f
using namespace std;

int n,m,x,y,c;
int dist[NMax];
vector<pair<int,int> > vecini[NMax];
queue<int> q;

void dijkstra(int x0){
    memset(dist, INF, sizeof(dist));

    dist[x0] = 0;

    q.push(x0);
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(int i = 0; i < vecini[nod].size(); i++){
            if(dist[vecini[nod][i].first] > dist[nod] + vecini[nod][i].second){
                dist[vecini[nod][i].first] = dist[nod] + vecini[nod][i].second;
                q.push(vecini[nod][i].first);
            }
        }
    }
    for(int i = 2; i <= n; i++){
        if(dist[i] != INF)
            printf("%d ",dist[i]);
        else
            printf("0 ");
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; i++){
        scanf("%d%d%d",&x,&y,&c);
        vecini[x].push_back(make_pair(y,c));
    }
    dijkstra(1);
    return 0;
}