#include <fstream>
#include <queue>
#include <vector>
#define INF 2000000001
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector < pair <int,int> > a[100011];
queue <int> q;
bool coada[100011];
int n,m,i,j,x,y,z,k,dist[100011],ciclu[100011],p;

void bellman()
{dist[1]=0;
    q.push(1);
    while(q.empty()==false)
    {
        k=q.front();
        q.pop();
        coada[k]=0;
        for(i=0;i<a[k].size();i++)
            if(dist[a[k][i].first]>dist[k]+a[k][i].second)
            {
                dist[a[k][i].first]=dist[k]+a[k][i].second;
                if(coada[a[k][i].first]==0)
                {


                    q.push(a[k][i].first);

                    coada[a[k][i].first]=1;

                }
            }
    }

}

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        a[x].push_back(make_pair(y,z));
    }
    for(i=1;i<=n;i++)
    {
        dist[i]=INF;
        ciclu[i]=1;
    }
bellman();

    for(i=2;i<=n;i++)
        g<<dist[i]<<" ";
    return 0;
}