#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

int main()
{
    int n,m;
    in>>n>>m;
    int inf=20001;
    vector<vector<pair<int,int>>> Graf(n+1);
    vector <int> dist(n+1,inf);
    dist[1]=0;
    vector<int >viz(n+1,0);


    for(int i=0;i<m;i++)
    {
        int a,b,c;
        in>>a>>b>>c;
        Graf[a].push_back({b,c});
    }
    int nod_curent=-1;
    for(int i=1;i<=n;i++)
    {
        int minim=20001;
        int ind_min=-1;
        for(int j=1;j<=n;j++)
        {
            if(dist[j]<minim && viz[j]==0)
            {
                ind_min=j;
                minim=dist[j];
            }
        }
        nod_curent=ind_min;
        viz[nod_curent]=1;
        for(auto j:Graf[nod_curent])
            if(dist[nod_curent]+j.second<dist[j.first])
            {
                dist[j.first]=dist[nod_curent]+j.second;
            }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==inf)
            out<<"0"<<" ";
        else
            out<<dist[i]<<" ";
    }



}