#include <fstream>
#include <queue>
#include <climits>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
auto cmp=[](pair <int, int> a, pair <int, int> b)
{
    if(a.first>b.first)
        return true;
    return false;
};
int n, m;
vector <pair<int, int>> G[50001];
priority_queue <pair<int, int>, vector <pair<int, int>>, decltype(cmp)> q(cmp);
bool viz[50001];
int Dmin[50001];
void incercare_dijkstra()
{
    Dmin[1] = 0;
    q.push({0, 1});
    while(!q.empty())
    {
        int x;
        x=q.top().second;
        q.pop();
        viz[x]=1;
        for(auto i:G[x])
            if(Dmin[i.second]>i.first+Dmin[x])
            {
                Dmin[i.second]=i.first+Dmin[x];
                q.push({Dmin[i.second], i.second});
            }
    }
}
int main()
{
    fin>>n>>m;
    int x, y, z;
    for(int o=0; o<m; o++)
    {
        fin>>x>>y>>z;
        pair <int, int> aux;
        aux.first=z;
        aux.second=y;
        G[x].push_back(aux);
    }
    for(int i=2; i<=n; i++)
        Dmin[i]=INT_MAX;
    incercare_dijkstra();
    for(int i=2; i<=n; i++)
        if(Dmin[i]!=INT_MAX)
            fout<<Dmin[i]<<" ";
        else fout<<0<<" ";
    return 0;
}