#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <set>
#define N 50010
#define INF 200000001

using namespace std;

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

vector <pair<int,int> > vec[N];
int dist[N],i,j,n,m,k,t,p,r,l;
bool Queue[N];
set<pair<int,int> > h;

int main()
{
    int from,to,cost;
    f>>n>>m;
    while(m!=0)
    {
        f>>from>>to>>cost;
        vec[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));
    int nod;
    while(!h.empty())
    {
        nod=h.begin()->second;
        h.erase(h.begin());
        for(vector<pair<int,int> >::iterator it=vec[nod].begin();it!=vec[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(i=2;i<=n;i++)
        if(dist[i]==INF)
            g<<0<<' ';
        else
            g<<dist[i]<<' ';
}