#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

#define mm 50001
#define inf (1<<30)
int n,m;
int dist[mm], seen[mm];
vector< pair<int,int> > v[mm];
queue<int> q;

void BF()
{
    q.push(1);
    dist[1] = 0;

    for(int i = 2; i <= n; i++)
        dist[i] = inf;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        seen[nod] = 0;

        vector< pair <int,int> >::iterator it;

        for(it = v[nod].begin(); it != v[nod].end(); it++)
        {
            int vecin = it -> first;
            int cost = it -> second;

            if(dist[nod] + cost < dist[vecin])
            {
                dist[vecin] = dist[nod] + cost;
                if (!seen[vecin])
                {
                    seen[vecin] = 1;
                    q.push(vecin);
                }
            }
        }
    }
}

void Afisare()
{
    for(int i = 2; i <= n; i++)
        if (dist[i] != inf)
            g << dist[i]<<" ";
        else
            g << 0 <<" ";
}

int main()
{
    f >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int x,y,z;
        f >> x >> y >> z;
        v[x].push_back(make_pair(y,z));
    }

    BF();
    Afisare();

    return 0;
}