#include <fstream>
#define max_value 10e9*2
#include <vector>
#include <queue>

using namespace std;

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

int d[50010],viz[50010],t[50010],n,m,i,x,y,c;

struct compara
{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};

vector<pair<int,int>>v[50010];
priority_queue<int, vector<int>,compara>q;

void dijkstra(int nod)
{
    int i,vecin,cost,curent,nr;
    for(i=1;i<=n;i++)
        d[i]=max_value;
    d[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        curent=q.top();
        q.pop();
        viz[curent]=1;
        nr=v[curent].size();
        for(i=0;i<nr;i++)
        {
            vecin=v[curent][i].first;
            cost=v[curent][i].second;
            if(d[curent]+cost<d[vecin])
            {
                d[vecin]=d[curent]+cost;
                t[vecin]=curent;
                if(viz[vecin]==0)
                {
                    q.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}

int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    dijkstra(1);
    for(i=2;i<=n;i++)
        cout<<d[i]<<" ";
    return 0;
}