#include <fstream>
#include <vector>
#include <queue>
#define INF 250000005

using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

int n,m;
long long distante[50005];
bool vizitati[50005];
vector< pair<int,int> > a[50005];
queue< pair<int,long long> > coada;

void dijkstra(int s)
{
    for(int i=1;i<=n;i++)
        distante[i]=INF;
    distante[s]=0;
    coada.push(make_pair(s,distante[s]));
    while(!coada.empty())
    {
        int nod=coada.front().first;
        int dist=coada.front().second;
        coada.pop();
        if(!vizitati[nod])
        {
            vizitati[nod]=1;
            for(int i=0;i<a[nod].size();i++)
            {
                int x=a[nod][i].second+dist;
                if(!vizitati[a[nod][i].first] && x<distante[a[nod][i].first])
                {
                    distante[a[nod][i].first]=x;
                    coada.push(make_pair(a[nod][i].first,distante[a[nod][i].first]));
                }
            }
        }
    }
}

int main()
{
    in>>n>>m;
    int x,y,z;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>z;
        a[x].push_back(make_pair(y,z));
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(distante[i]==INF)
            out<<0<<" ";
        else
            out<<distante[i]<<" ";
    }
    in.close();
    out.close();
    return 0;
}