#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

struct vecin
{
    int e1, cost;
};
queue <int> q;
vector <vecin> L[50005];
int h[50005], n, m;
bool g[50005];
void citire()
{
    fin >> n >> m;
    int a, b, c;
    for(int i=1;i<=m;i++)
    {
        fin >> a >> b >> c;
        L[a].push_back({b, c});
    }
    for(int i=1;i<=n;i++)
        h[i]=9999999;
}

void dijkstra(int nod)
{
    q.push(nod);
    h[nod]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        //g[nod]=0;
        for(unsigned int i=0;i<L[nod].size();i++)
        {
            int vecin=L[nod][i].e1;
            if(h[nod]+L[nod][i].cost<h[vecin])
            {
                h[vecin]=h[nod]+L[nod][i].cost;
                q.push(vecin);
                //g[nod]=1;
            }
        }
    }
}

int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(h[i]==9999999)
            fout<<"0 ";
        else
            fout<< h[i] <<" ";
    }
    return 0;
}