/*#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");*/

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int pinf=1<<30;
int n,m,x,y,c,viz[50010],d[50010],ok,nod;
vector <pair<int, int>>g[50010];
queue <int> q;

void bellman()
{
    int i;
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        viz[nod]++;
        if (viz[nod]>=n)
        {
            ok=1;
            return;
        }
        for (i=0;i<g[nod].size();i++)
            if (d[g[nod][i].first]>d[nod]+g[nod][i].second)
            {
                d[g[nod][i].first]=d[nod]+g[nod][i].second;
                q.push(g[nod][i].first);
            }
    }
}

int main()
{
    int i;
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    for (i=2;i<=n;i++)
        d[i]=pinf;
    q.push(1);
    bellman();

        for (i=2;i<=n;i++)
            fout<<d[i]<<" ";
    return 0;
}