#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <set>
#include <cstring>
#include <map>
#define INF 1e9
#define NMAX 100001
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int check_prim(int n)
{
    if(n<2)return 0;
    if(n == 2)return 1;
    if(n%2==0)return 0;
    for(int i=3;i*i<=n;i+=2)
    if(n%i==0)return 0;
    return 1;
}
struct nod
{
    int val;
    nod*st;
    nod*dr;
};
void citire(nod *&p , int n)
{
    int x;
    f>>x;
    if(x==0) p = NULL;
    else
    {
        p = new nod;
        p->val = x;
        citire(p->st , n-1);
        citire(p->dr , n-1);
    }
}
vector<pair<int,int>>G[NMAX];
bool inCoada[NMAX];
int N , M;
int D[NMAX];
priority_queue<int>Q;
void dijkstra(int nodStart)
{
    for(int i=1;i<=N;i++)
    D[i] = INF;
    
    D[nodStart] = 0;
    Q.push(nodStart);
    inCoada[nodStart] = 1;
    while(!Q.empty())
    {
        int nodCurent = Q.top();
        Q.pop();
        inCoada[nodCurent] = 0;
        for(int i =0 ; i<G[nodCurent].size();i++)
        {
            int vecin = G[nodCurent][i].first;
            int cost = G[nodCurent][i].second;
            if(D[nodCurent] + cost < D[vecin])
            {
                D[vecin] = D[nodCurent] + cost;
                if(inCoada[vecin] == 0)
                {
                    Q.push(vecin);
                    inCoada[vecin] = 1;
                }
            }
        }
    }
}
int main()
{
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x , y, c;
        f>>x>>y>>c;
        G[x].push_back(make_pair(y, c));
    }
    dijkstra(1);
    for(int i=2;i<=N;i++)
        g<<D[i]<<" ";
        return 0;
}