#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define INF 1000000001
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N=5e4+1;
int n,m;
int d[N];
vector <pair<int,int>> a[N];
priority_queue <pair<int,int>> q;
bitset <N> selectat;

void dijkstra(int nod){
    for(int i=1; i<=n; i++)
        d[i]=INF;
    d[nod]=0;
    q.push({0,nod});
    while(!q.empty()){
        int x=q.top().second;
        q.pop();
        if(selectat[x])
            continue;
        selectat[x]=1;
        for(auto j:a[x]){
            int y=j.first;
            int c=j.second;
            if(d[x]+c<d[y]){
                d[y]=d[x]+c;
                q.push({-d[y],y});
            }
        }
    }
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++){
        int x,y,c;
        f>>x>>y>>c;
        a[x].push_back({y,c});
    }
    dijkstra(1);
    for(int i=2; i<=n; i++){
        if(d[i]==INF)
            d[i]=0;
        g<<d[i]<<" ";
    }
    return 0;
}