#include <cstdio>
#include <set>
#include <cstring>
#include <vector>

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

set<pair<int,int> > H;
vector<pair<int, int> > vecini[NMax];
int n,m,x,y,c;

void dijkstra(int x0){
    int dist[NMax];

    memset(dist,INF,sizeof(dist));

    dist[x0] = 0;
    H.insert(make_pair(0,x0));

    while(H.size()){
        int minim = (*H.begin()).first;
        int nod = (*H.begin()).second;
        H.erase(*H.begin());
        for(int i = 0; i < vecini[nod].size();i++){
            if(dist[vecini[nod][i].first] > vecini[nod][i].second + dist[nod]){
                dist[vecini[nod][i].first] = vecini[nod][i].second + dist[nod];
            }
            H.insert(make_pair(dist[vecini[nod][i].first], vecini[nod][i].first));
        }
    }
    for(int i = 2; i <= n; i++){
        if(dist[i] == INF)
            printf("0 ");
        else
            printf("%d ",dist[i]);
    }
}
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;
}