#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
struct lista{
    int x,c;
};

vector <lista> v[50001];
int i,j,m,n,d[50001],viz[50001],a,b,c;
class cmp{
public:
     bool operator()( const int &x, const int &y){
        return d[x]>d[y];
     }


};
priority_queue < int, vector<int>, cmp > q;

void coada(int x){
    int nod,cost,j;
    q.push(x);

while(!q.empty()){
        nod=q.top();
        cost=d[nod];
           q.pop();
      if(viz[nod]==0){
        viz[nod]=1;

        for(j=0;j<v[nod].size();j++)
            if(viz[v[nod][j].x]==0 && d[v[nod][j].x]>d[nod]+v[nod][j].c){
                    d[v[nod][j].x]=d[nod]+v[nod][j].c;
                    q.push(v[nod][j].x);

                }
    }
}
}
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=2;i<=n;i++)
        if(d[i]!=INT_MAX)
            cout<<d[i]<<" ";
        else
            cout<<0<<" ";
    return 0;
}