#include <fstream>
#include <queue>
#define INF 0x3FFFFFFF
using namespace std;

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

int n,m;

bool viz[50005];

vector <pair<int,int>> v[50005];

priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;

int d[50005];

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].push_back({c,y});
    }

    for(int i=1;i<=n;i++)
    {
        d[i]=INF;
    }
    d[1]=0;
    q.push({0,1});
    while(!q.empty())
    {
        int nod = q.top().second;
        q.pop();

        if(viz[nod])
            continue;
        viz[nod]=true;

        for(auto& i : v[nod])
        {
            int vecin = i.second;
            int cost = i.first;
            if(!viz[vecin] && d[nod]+cost < d[vecin])
            {
                d[vecin]=d[nod]+cost;
                q.push({d[vecin],vecin});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INF)
            fout<<0;
        else
            fout<<d[i];
        fout<<' ';
    }
}