#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define NMAX 50001
int n,m,x,y,z;
int dist_min[NMAX];
bool vizitat[NMAX];

class cmp{
public:
    bool operator ()(int a, int b){
        return dist_min[a]>dist_min[b];
    }
};

vector<pair<int,int>> v[NMAX];
priority_queue<int,vector<int>,cmp> q;

void dijkstra(int m){

    for(int i=1;i<=n;i++){
        dist_min[i]=1000000000;
    }

    q.push(m);
    vizitat[m]=1;
    dist_min[m]=0;

    while(!q.empty()){
        int x=q.top();
        q.pop();
        vizitat[x]=1;
        for(auto u:v[x]){
            if(dist_min[x]+u.second<dist_min[u.first]){
                dist_min[u.first]=dist_min[x]+u.second;
                if(!vizitat[u.first]){
                    vizitat[u.first]=1;
                    q.push(u.first);
                }
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++){
        fout<<dist_min[i]<<" ";
    }
    return 0;
}