#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define nrm 50005
const int oo = (1<<31)-1;
vector< pair<int,int> >g[nrm];
int n,m;
int ap[nrm];
int d[nrm];
struct comp
{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};
priority_queue<int,vector<int>,comp>pq;
void dij(int k)
{
    for(int i=1;i<=n;i++)
    {
        d[i]=oo;
    }
    d[k]=0;
    pq.push(k);
    ap[k]=1;
    while(pq.empty()==0)
    {
        int nod=pq.top();
        pq.pop();
        ap[nod]=0;
        for(int i=0;i<g[nod].size();i++)
        {
            int vecin=g[nod][i].first;
            int cost=g[nod][i].second;
            if(d[nod]+cost<d[vecin])
            {
                d[vecin]=cost+d[nod];
                if(ap[vecin]==0)
                {
                    pq.push(vecin);
                    ap[vecin]=1;
                }
            }
        }
    }
}
int main ()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,cost;
        fin>>x>>y>>cost;
        g[x].push_back(make_pair(y,cost));
    }
    dij(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=oo)
        {
            fout<<d[i]<<" ";
        }
        else
        {
            fout<<"0"<<" ";
        }
    }
    fin.close();
    fout.close();
    return 0;
}