#include <fstream>
#include <vector>
#include <queue>
using namespace std;
struct lista{
    int x,c;
};
struct dist{
    int d,nod;
};
vector <lista> v[50001];
priority_queue <dist> q;
int i,j,m,n,d[50001],viz[50001],a,b,c;
void coada(int x){
    int nod,cost,i,j;
    q.push({0,x});
    viz[1]=1;
    for(i=1;i<n;i++){
        nod=q.top().nod;
        cost=q.top().d;
        q.pop();
        for(j=0;j<v[nod].size();j++)
            if(viz[v[nod][j].x]==0)
                if(d[v[nod][j].x]>d[nod]+v[nod][j].c){
                    d[v[nod][j].x]=d[nod]+v[nod][j].c;
                    q.push({d[nod]+v[nod][j].c,v[nod][j].x});
                    viz[v[nod][j].x]=1;
                }
    }
}
int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(i=2;i<=n;i++)
        d[i]=INT_MAX;
    coada(1);
    for(i=1;i<=n;i++)
        cout<<d[i]<<" ";
    return 0;
}