#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int nlim=50005;
const int oo=1<<30;
int n,m,D[nlim],InCoada[nlim];
vector <pair <int, int> > muchii[nlim];

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

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

void Dijkstra(int nodstart)
{
    coada.push(nodstart);
    InCoada[nodstart]=1;
    D[nodstart]=0;
    while(!coada.empty())
    {
        int nod=coada.top();
        coada.pop();
        InCoada[nod]=0;
        for(int i=0;i<muchii[nod].size();i++)
        {
            int vecin=muchii[nod][i].first;
            int cost=muchii[nod][i].second;
            if(D[nod]+cost<D[vecin])
            {
                D[vecin]=D[nod]+cost;
                if(InCoada[vecin]==0)
                {
                    coada.push(vecin);
                    InCoada[vecin]=1;
                }
            }
        }
    }
}

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

int main()
{
    citire();
    Dijkstra(1);
    for(int i=2;i<=n;i++)
        if(D[i]!=oo)
            g<<D[i]<<" ";
        else g<<"0 ";
    return 0;
}