#include<fstream>
#include<vector>
#include<queue>
#define INF 1000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n, m, viz[50001];
typedef struct nod
{
    int y, cost;
}NOD;
vector <NOD>v[50001];
vector <NOD> ::iterator it;
NOD w;
queue <int> c;
void citire()
{
    int i, j, x, y, pret;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>pret;
        w.y=y;
        w.cost=pret;
        v[x].push_back(w);
    }
}
void bmf()
{
    int i,mini,poz,p,u;
    c.push(1);
    for(i=2;i<=n;i++)viz[i]=INF;
    while(!c.empty())
    {
        mini=INF;
        p=c.front();
        for(i=0;i<v[p].size();i++)
        {
            if(viz[v[p][i].y]>viz[p]+v[p][i].cost&&v[p][i].cost<mini)
            {
                mini=v[p][i].cost;
                poz=v[p][i].y;
                viz[poz]=viz[p]+v[p][i].cost;
                c.push(poz);
            }
        }

        if(mini==INF)c.pop();
    }
}
int main()
{
    citire();
    int i;
    bmf();
    for(i=2;i<=n;i++)g<<viz[i]<<" ";
    f.close();
    g.close();
    return 0;
}