#include <fstream>
#include <vector>
#include <queue>
#define inf 1000000500
#define nmax 50005
using namespace std;
int n,m;
int d[nmax];
bool verif[nmax];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair<int,int> >v[nmax];
priority_queue <pair<int,int>, vector <pair< int,int> >, greater <pair <int,int> >  > q;
int main()
{
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        v[x].push_back(make_pair(z,y));
    }
    for (int i=2; i<=n; i++)
        d[i]=inf;
    q.push(make_pair(0,1));
    verif[1]=true;
    while (!q.empty())
    {
        int nod=q.top().second;
        int cost=q.top().first;
        q.pop();
        verif[nod]=false;
        for (vector <pair<int,int> >:: iterator it=v[nod].begin(); it!=v[nod].end(); it++)
        {
            int nod_n=(*it).second;
            int cost_n=(*it).first;
            if (d[nod_n]>cost_n+cost)
            {
                d[nod_n]=cost_n+cost;
                if (!verif[nod_n])
                {
                    verif[nod_n]=true;
                    q.push(make_pair(d[nod_n],nod_n));
                }
            }
        }
    }
    for (int i=2; i<=n; i++)
        if (d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<< ' ';
    return 0;
}