#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int nmax=50000;
struct graf
{
    int nod,cost;
};
struct data
{
    int nod;
};
vector<graf>v[nmax+5];
int best[nmax+5];
auto cmp = [](data a,data b)
{
    return best[a.nod]>best[b.nod];
};

using data_container = std::vector<data>;

priority_queue<data,data_container,decltype(cmp)> q(cmp);
int n,m;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,cost;
        fin>>a>>b>>cost;
        v[a].push_back({b,cost});
    }
    for(int i=1;i<=n;i++)
        best[i]=-1;
    best[1]=0;
    q.push({1});
    while(!q.empty())
    {
        int nod=q.top().nod;
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int nod_nou=v[nod][i].nod;
            if(best[nod_nou]==-1)
            {
                best[nod_nou]=best[nod]+v[nod][i].cost;
                q.push({nod_nou});
            }
            else if(best[nod]+v[nod][i].cost<best[nod_nou])
            {
                best[nod_nou]=best[nod]+v[nod][i].cost;
                q.push({nod_nou});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(best[i]==-1)
            fout<<"0 ";
        else
            fout<<best[i]<<" ";
    }
    return 0;
}
/**

**/