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

struct nod{
    int x, cost;
};

int d[50001], viz[50001];
vector <nod> l[50001];
priority_queue<pair<long long, int>, vector <pair<long long, int>>, greater<pair<int, int>>> q;

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;
    }
    q.push({0, 1});
    for(i=1;i<=n;i++)
    {
        int nod=q.top().second;
        int cost=q.top().first;
        q.pop();
        if(viz[nod]==1)
        {
            continue;
        }
        viz[nod]=1;
        for(i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].x;
            int cost=l[nod][i].cost;
            if(d[vecin]>d[nod]+cost)
            {
                q.push({cost, vecin});
                d[vecin]=d[nod]+cost;
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        fout<<d[i]<<" ";
    }
}