#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<int> v[mm],w[mm];
queue<int> q;

void Initializare()
{
    for(int i = 2; i <= n; i++)
        dist[i] = inf;
}

void Dijkstra()
{
    q.push(1);
    seen[1] = 1;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();

        for(int i = 0; i < v[nod].size(); i++)
        {
            int target = v[nod][i];

            if (dist[nod] + w[nod][i] < dist[target])
            {
                dist[target] = dist[nod] + w[nod][i];

                if (!seen[target])
                    q.push(target);

                seen[target] = 1;
            }
        }
    }
}

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(y);
        w[x].push_back(z);
    }

    Initializare();
    Dijkstra();
    Afisare();

    return 0;
}