#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
#define INF 99999999

using namespace std;

int n,m;
int d[50005];
bool sel[50005];
int stiva[50005],nr;
struct cmp{

bool operator()(int x,int y){
    if(d[x]!=d[y])
return d[x]<d[y];
return x<y;
}

};
void sortare(){
for(int i=1;i<=nr;i++)
    for(int j=i+1;j<=nr;j++)
    if(d[stiva[i]]<d[stiva[j]])swap(stiva[i],stiva[j]);
    else if(stiva[i]<stiva[j])swap(stiva[i],stiva[j]);
}
std::priority_queue <int,std::vector<int>,cmp>q;
vector<pair<int,int>>g[50005];
void dijkstra(int p){
    for(int i=1;i<=n;i++)
        sel[i]=false, d[i]=INF;
    d[p]=0;
    //q.push(p);
    stiva[++nr]=p;
    sel[p]=true;
    //while(!q.empty())
    while(nr>0)
    {
        //int k=q.top();
        //q.pop();
        int k=stiva[nr];
        nr--;
        sel[k]=true;
        for(int j=0;j<g[k].size();j++)
        {
            int y=g[k][j].first;
            int cost=g[k][j].second;
            if(d[y]>d[k]+cost){
                d[y]=d[k]+cost;
                //q.push(y);
                if(!sel[y])
                stiva[++nr]=y;
                sortare();
                sel[y]=true;
            }
        }
    }
}
int main(){
        freopen("dijkstra.in","r",stdin);
        freopen("dijkstra.out","w",stdout);
        scanf("%d %d",&n,&m);
        int x,y,c;
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d %d",&x,&y,&c);
            g[x].push_back(make_pair(y,c));
        }
        int p=1;
        dijkstra(p);
        for(int i=1;i<=n;i++)
        {
            if(d[i]==INF && i!=p)printf("0 ");
            else if(i!=p)printf("%d ",d[i]);
        }



    return 0;
}