#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define nmax 50005
#define inf 100000000
using namespace std;

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

vector < pair<int ,int> > v[nmax];
queue <int> q;
int n,m,s,a,b,i,c,nod[nmax];

void dijkstra()
{
    for (i=1;i<=n;i++)
        nod[i]=inf;
    nod[1]=0;
    q.push(1);


    while (!q.empty())
    {
        int cur=q.front();



        for (i=0; i<v[cur].size(); i++)
            if(nod[i]+v[cur][i].second<nod[v[cur][i].first])
            {
                    nod[v[cur][i].first]=nod[cur]+v[cur][i].second;
                        q.push(v[cur][i].first);

            }
            q.pop();
    }

}

int main()
{

    f>>n>>m;
    q.push(1);

    for (i=1; i<=m; i++)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }

    dijkstra();
    for (i=2; i<=n; i++)
        if (nod[i]!=inf)
            g<<nod[i]<<" ";
            else
                g<<"0 ";

    return 0;
}