#include<fstream>
#include<set>
#include<vector>
#define NMAX 50005
#define INF 2000000000
using namespace std;
set<pair<int, int> > s;
vector<pair<int, int> > G[NMAX];
int n, m, x, y, z, nod, i;
int fiu, dist;
int d[NMAX];
bool u[NMAX];
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

void init()
{
    for(nod = 1 + 1; nod <= n; nod++)
    {
        d[nod] = INF;
    }
}

void remove_dpl()
{
    while(!s.empty() && u[nod] == 1)
    {
        nod = s.begin() -> second;
        s.erase(s.begin());
    }
}

void dijkstra()
{
    init();
    s.insert(make_pair(0, 1));

    while(!s.empty())
    {
        nod = s.begin() -> second;

        remove_dpl();

        if(s.empty())
        {
            break;
        }

        u[nod] = 1;
        s.erase(s.begin());

        for(i = 0; i < G[nod].size(); i++)
        {
            fiu = G[nod][i].second;
            dist = G[nod][i].first;
            if(d[fiu] > d[nod] + dist)
            {
                d[fiu] = d[nod] + dist;
                s.insert(make_pair(d[fiu], fiu));
            }
        }
    }

}
void afisare()
{
    for(nod = 1 + 1; nod <= n; nod++)
    {
        if(d[nod] != INF)
        {
            cout << d[nod] << " ";
        }else
        {
            cout << "0 ";
        }
    }
}
int main()
{
    cin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        cin >> x >> y >> z;
        G[x].push_back(make_pair(z, y));
    }
    dijkstra();
    afisare();
    return 0;
}