#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector<pair<int,int> > v[50005];
int dist[50005], verif[50005];
int main(){
    dist[1]=0;
    int n,m;
    cin>>n>>m;
    for(int i=2;i<=n;i++)
        dist[i]=99999999;
    for(int i=1;i<=m;i++){
        int x,y,c;
        cin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    priority_queue<pair<int,int> > q;
    q.push(make_pair(0,1));
    while(!q.empty()){
        int nod=q.top().second;
        q.pop();
        for(int i=0;i<v[nod].size();i++){
            if(verif[v[nod][i].first]==0){
                verif[v[nod][i].first]=1;
                if(dist[nod]+v[nod][i].second<dist[v[nod][i].first])
                    dist[v[nod][i].first]=dist[nod]+v[nod][i].second;
                q.push(make_pair(-dist[v[nod][i].first],v[nod][i].first));
            }
        }
    }
    for(int i=2;i<=n;i++){
        if(dist[i]==99999999)
            cout<<"0 ";
        else
            cout<<dist[i]<<" ";
    }
}