#include <fstream>
#include <vector>
#include <set>
#define INF 2e9
#define NMAX 50000

using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

vector <pair<int,int>> v[NMAX+1];
int viz[NMAX+1], dist[NMAX+1], n;

void dijkstra(int nod)
{
    for (int i=1; i<=n; i++)
        dist[i] = INF;
    set<pair<int,int>> name;
    dist[nod] = 0;
    name.insert({0,nod});
    while (name.size()>0)
    {
        int n1 = name.begin()->second;
        name.erase(name.begin());
        if (!viz[n1])
        {
            viz[n1] = 1;
            for (auto& i:v[n1])
            {
                int vecin = i.first, cost = i.second;
                if (dist[n1] + cost < dist[vecin])
                {
                    dist[vecin] = dist[n1] + cost;
                    name.insert({dist[vecin], vecin});
                }
            }
        }
    }
}

int main()
{
    int m;
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int n1,n2,c;
        cin>>n1>>n2>>c;
        v[n1].push_back({n2,c});
    }

    dijkstra(1);

    for (int i=2; i<=n; i++)
        if (dist[i]!=INF)
            cout<<dist[i]<<" ";
        else
            cout<<"0 ";
    return 0;
}