#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair <int,int> > A[1000001];
int n,m,p;
unsigned int R[1000001];
bool viz[1000001];
priority_queue <pair <int,int> > Q;
int main()
{
    fin>>m>>n;
    for(int i=1; i<=n; i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({c,b});
    }
    Q.push({0,1});
    for(int i=1; i<=m; i++)
        R[i]=2000000000;
    R[1]=0;
    while(!Q.empty())
    {
        pair<int,int> nod=Q.top();
        Q.pop();
        int g=A[nod.second].size();
        for(auto it:A[nod.second])
        {
            int d=it.second;
            int co=it.first;
            if(viz[it.second]==0)
            {
                if(R[d]>R[nod.second]+co)
                {
                    R[d]=R[nod.second]+co;
                    viz[nod.second]=0;
                    Q.push({-R[d], d});
                }
            }
        }
    }


    for(int i=2; i<=m; i++)
        fout<<R[i]<<" ";
    return 0;
}