#include <fstream>
#include <vector>
#include <queue>
#define inf 100000000
#define dim 50001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct muchie{
    int nod, cost;
};

priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
vector <muchie> l[dim];
int d[dim], viz[dim];

int main()
{
    int n, m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
    }
    for(i=2;i<=n;i++)
    {
        d[i]=inf;
    }
    d[1]=0;
    pq.push({0, 1});
    while(!pq.empty())
    {
        int nod=pq.top().second;
        int cost=pq.top().first;
        pq.pop();
        if(viz[nod]==1)
        {
            continue;
        }
        viz[nod]=1;
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].nod;
            int cost2=l[nod][i].cost;
            if(viz[vecin]==0)
            {
                if(d[vecin]>d[nod]+cost2)
                {
                    d[vecin]=d[nod]+cost2;
                    pq.push({d[vecin], vecin});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==inf)
        {
            fout<<0<<" ";
            continue;
        }
        fout<<d[i]<<" ";
    }
}