#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <queue>
#define NMAX 50001
#define INF 10002
#define nod first
#define cost second
using namespace std;
vector< pair<int, int> > a[NMAX];
queue<int> T;

bool incoada[NMAX];

int n,m,x,y,c,d[NMAX],iterariNod[NMAX],nod,p[NMAX];

void bf()
{

    int ned;
    while(!T.empty())
    {

        ned = T.front();
        T.pop();
        incoada[ned] =false;
        for(int i=0;i<a[ned].size();i++)
        {

            if(d[a[ned][i].nod] > d[ned] + a[ned][i].cost)
            {

                d[a[ned][i].nod] = d[ned] + a[ned][i].cost;
                p[a[ned][i].nod] = p[ned];
                if(!incoada[a[ned][i].nod])
                {
                    T.push(a[ned][i].nod);
                    incoada[a[ned][i].nod] = true;
                }
            }
            else if(d[a[ned][i].nod] == d[ned] + a[ned][i].cost)
                p[a[ned][i].nod] = min( p[ned],p[a[ned][i].nod]) ;

        }
    }
}

int main()
{
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    in >> n >> m;
    for(int i=0;i<m;i++)
    {
        in >> x >> y >> c;
        a[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++)
    {
        d[i]= INF;
    }
    T.push(1);
    incoada[1]=true;
    bf();

    for(int i=2;i<=n;i++)
        out << d[i] << " ";
    return 0;
}