#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
const int nmax=50001;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n, m;
int d[nmax],viz[nmax];
vector<pair<int,int>>a[nmax];
priority_queue<pair<int,int>>q;

void dijkstra()
{
    for(int i=1; i<=n; i++)
        d[i]=INT_MAX;
    d[1]=0;
    q.push({0,1});
    while(!q.empty())
    {
        int k=q.top().second;
        q.pop();
        if(viz[k]==0)
        {
            viz[k]=1;
            for(auto crt:a[k])
                if(d[crt.second]>d[k]+crt.first)
                {
                    d[crt.second]=d[k]+crt.first;
                    q.push({-d[crt.second],crt.second});
                }
        }

    }
}

int main()
{
    int x,y,c;
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y>>c;
        a[x].push_back({c,y});
    }
    dijkstra();
    for(int i=2; i<=n; i++)
        if(d[i]==INT_MAX)
            fout<<"0 ";
        else
            fout<<d[i]<<' ';

    fin.close();
    fout.close();
    return 0;
}