#include <iostream>
#include <bits/stdc++.h>
#define inf 50000000001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct nod
{
    int vecin, cost;
    bool operator < (const nod &other) const
    {
        if(cost!=other.cost)
        {
            return cost<other.cost;
        }
        return vecin<other.vecin;
    }
};
vector <nod> g[50001];
int dmin[50001], x, y, c, n, m;
set <nod> S;
void dijkstra(int start)
{
    for(int i=1; i<=n; i++)
    {
        dmin[i]=inf;
    }
    dmin[start]=0;
    S.insert({start, 0});
    while(!S.empty())
    {
        int nd=S.begin()->vecin;
        S.erase(S.begin());
        for(auto x:g[nd])
        {
            int cost_p=x.cost+dmin[nd];
            if(cost_p<dmin[x.vecin])
            {
                if(dmin[x.vecin]!=inf)
                {
                    S.erase({x.vecin, dmin[x.vecin]});
                }
                dmin[x.vecin]=cost_p;
                S.insert({x.vecin, dmin[x.vecin]});
            }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        g[x].push_back({y, c});
    }
    dijkstra(1);
    for(int i=2; i<=n; i++)
    {
        fout<<dmin[i]<<" ";
    }
    return 0;
}