#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
struct muchie{
        int x;
        int c;
};
vector <muchie> v[100001];
queue <int> q;
int n,m,x,y,cost,d[100001],p,viz[100001],Min,i,j;
void coada(int x){
    int i,vecin,nod,p,cost,Min;
    q.push(x);
    viz[x]=1;
    while(!q.empty()){
        nod=q.front();
        q.pop();
        Min=INT_MAX;
        for(i=0;i<v[nod].size();i++){
            vecin=v[nod][i].x;
            cost=v[nod][i].c;
            if(d[vecin]>d[nod]+cost)
                d[vecin]=d[nod]+cost;
            viz[vecin]=1;
            q.push(vecin);
            /*if(viz[vecin]==0 && d[vecin]<Min){
                p=vecin;
                Min=d[vecin];
            }
            viz[p]=1;
            for(j=1;j<=n;j++){
                if(viz[j]==0&&d[j]>d[p]+cost)
                    d[j]=d[p]+cost;
            }*/
        }
    }
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>x>>y>>cost;
        v[x].push_back({y,cost});
        if(x==1)
            d[y]=cost;
    }
    for(i=2;i<=n;i++)
        d[i]=INT_MAX;
    coada(1);
    for(i=2;i<=n;i++)
        cout<<d[i]<<" ";
    return 0;
}