#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int inf = (1 << 30);

int n,m,d[50005];
bool incoada[50005];

vector <pair <int,int> > g[50005];

struct compara
{
    bool operator()(int x, int y)
    {
        return d[x]>d[y];
    }
};

priority_queue<int, vector<int>,compara> coada;

void citire()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
}

void dijkstra(int nod_start)
{
    int i;
    for(i=1;i<=n;i++)
    {
        d[i]=inf;
    }
    d[nod_start]=0;
    coada.push(nod_start);
    incoada[nod_start]=true;
    while(!coada.empty())
    {
        int nod_curent = coada.top();
        coada.pop();
        incoada[nod_curent] = false;
        for(size_t i = 0; i < g[nod_curent].size(); i++)
        {
            int vecin = g[nod_curent][i].first;
            int cost = g[nod_curent][i].second;
            if(d[nod_curent] + cost < d[vecin])
            {
                d[vecin] = d[nod_curent] + cost;
                if(incoada[vecin] == false)
                {
                    coada.push(vecin);
                    incoada[vecin] = true;
                }
            }
        }
    }
}

void afisare()
{
    for(int i = 2; i <= n; i++)
    {
        if(d[i] != inf)
            fout << d[i] << " ";
        else
            fout << "0 ";
    }
}

int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}