#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,d[50001];
int x,y,cost;
bool viz[50001];
struct muchie{
    int v,c;
};
vector<muchie>l[50001];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
       cin>>x>>y>>cost;
       l[x].push_back({y,cost});
    }
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    for(int i=1;i<=n;i++){
        ///gasim nodul care are in d val minima si este nevizitat
        int min1=INT_MAX,p=0;
        for(int j=1;j<=n;j++){
            if(d[j]<min1&&viz[j]==0){
                min1=d[j];
                p=j;
            }
        }
        viz[p]=1;
        for(auto vec :l[p]){
                int nod=vec.v, cost=vec.c;
            if(d[nod]>d[p]+cost){
                d[nod]=d[p]+cost;
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(d[i]==INT_MAX)
            cout<<0<<" ";
        else
            cout<<d[i]<<" ";
    return 0;
}