#include <fstream>
#define INF 2000000000
#include <vector>
#include <set>
#include <utility>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct muchie{
    int x, cost;
};

int d[50001], viz[50001];
vector <muchie> l[50001];
set <pair<long long, int>> s;

int main()
{
    int n, i, m, x, y, c, j, p, k, vecin, cost;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
    }
    for(i=1;i<=n;i++)
    {
        d[i]=INF;
    }
    d[1]=0;
    s.insert(make_pair(0,1));
    while(s.empty()==0)
    {
        k=s.begin()->second;
        s.erase(s.begin());
        for(i=0;i<l[k].size();i++)
        {
            vecin=l[k][i].x;
            cost=l[k][i].cost;
            if(d[vecin]>d[k]+cost)
            {
                s.erase(make_pair(d[vecin], vecin));
                d[vecin]=d[k]+cost;
                s.insert(make_pair(d[vecin], vecin));
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==INF)
        {
            fout<<0<<" ";
            continue;
        }
        fout<<d[i]<<" ";
    }
}