#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int T[50100],viz[50100],n,m,x,y,ct;
vector<int>G[50100],cost[50100];
queue<int>q;
void bfs(int x){
    viz[x]=1;
    q.push(x);
    T[x]=0;
    while(!q.empty()){
        x=q.front();
        for(int i=0;i<G[x].size();++i){
            if(T[x]+cost[x][i]<T[G[x][i]]){
                T[G[x][i]]=T[x]+cost[x][i];
                if(!viz[G[x][i]]){
                    viz[G[x][i]]=1;
                    q.push(G[x][i]);
                }
            }
        }
        viz[x]=0;
        q.pop();
    }
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i){
        f>>x>>y>>ct;
        G[x].push_back(y);
        cost[x].push_back(ct);
    }
    for(int i=1;i<=n;++i){
        T[i]=999999999;
    }
    bfs(1);
    for(int i=2;i<=n;++i){
        if(T[i]!=999999999) g<<T[i]<<" ";
        else g<<0<<" ";
    }
}