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

#define N 50010
#define inf 200000000

using namespace std;

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

vector < pair <int,int> > v[N];
set <pair <int,int> > h;

int n,m,i,j,from,to,cost,dist[N],nod;

int main()
{
    f>>n>>m;
    while(m)
    {
        f>>from>>to>>cost;
        v[from].push_back(make_pair(to,cost));
        m--;
    }
    for(i=1;i<=n;i++)
        dist[i]=inf;
    dist[1]=0;
    h.insert(make_pair(0,1));
    while(!h.empty())
    {
        nod=h.begin()->second;
        h.erase(h.begin());
        vector <pair <int,int> > ::iterator it;
        for(it=v[nod].begin();it!=v[nod].end();it++)
        {
            to = it->first;
            cost= it->second;
            if(dist[to]>dist[nod]+cost)
            {
                if(dist[to]!=inf)
                    h.erase(h.find(make_pair(dist[to],to)));
                dist[to]=dist[nod]+cost;
                h.insert(make_pair(dist[to],to));
            }
        }

    }
    for(int i=2;i<=n;i++)
        {
            if(dist[i]==inf)
                g<<0<<' ';
            else
                g<<dist[i]<<' ';
        }
    return 0;
}