#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int nlim=50005;
const int oo=(1<<30);
vector <pair<int, int>> G[nlim];
bool viz[nlim];
int d[nlim];
struct comp
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};
int n,m,nrc=0;

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

void dijkstra(int nod)
{
    for(int i=1; i<=n; i++)
    {
        d[i]=oo;
    }
    d[nod]=0;
    coada.push(nod);
    viz[nod]=true;
    while(!coada.empty())
    {
        int nc=coada.top();
        coada.pop();
        viz[nc]=false;
        for(unsigned int i=0; i<G[nc].size(); i++)
        {
            int vecin=G[nc][i].first;
            int cost=G[nc][i].second;
            if(d[nc]+cost<d[vecin])
            {
                d[vecin]=d[nc]+cost;
                if(viz[vecin]==false)
                {
                    coada.push(vecin);
                    viz[vecin]=true;

                }
            }
        }
    }
}


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++)
    {
        if(d[i]!=oo)
            g<<d[i]<<" ";
        else
            g<<0;
    }
}