#include <bits/stdc++.h>


using namespace std;

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

const int NMax = 50007;

const int inf = 2e9;

int d[NMax], n, m;

bool viz[NMax];

struct cmp
{
  bool operator () (int x, int y)
  {
      return d[x] > d[y];
  }
};

vector < pair < int, int > > v[NMax];

priority_queue <int, vector <int>, cmp> q;
void citire()
{
    fin >> n >> m;

    while(m--)
    {
        int x, y, c;

        fin >> x >> y >> c;

        v[x].push_back({y, c});
    }

    for(int i = 1; i <= n; i++)
        d[i] = inf;
}

void dijkstra (int NStart)
{
    q.push(NStart);

    viz[NStart] = 1;
    d[NStart] = 0;
    while(!q.empty())
    {

        int NodCurent = q.top();
        q.pop();
        viz[NodCurent] = 0;

        for(int i = 0; i < v[NodCurent].size(); i++)
        {
            int vecin = v[NodCurent][i].first;
            int cost = v[NodCurent][i].second;

            if(d[NodCurent] + cost < d[vecin])
            {
                d[vecin] = d[NodCurent] + cost;
                if(viz[vecin] == 0)
                {
                    viz[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
}


void afisare()
{
    for(int i = 2; i <= n; i++)
    {
        if(d[i]!=inf)
            fout << d[i] << " ";
        else
            fout << 0 << " ";
    }
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
}