#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define NMAX 1001
#define infinit 100001
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int dist[NMAX],viz[NMAX];
struct comp{

    bool operator()(int x, int y){

     return dist[x] > dist[y];
    }
};
vector <pair <int,int> > G[NMAX];
priority_queue<int, vector <int>, comp> q;

int main()
{int n,m,x,y,i,c,nod_start,curent,vecin,cost;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)dist[i]=infinit;
    dist[1]=0;
    viz[1]=1;
    q.push(1);
    while(!(q.empty()))
    {
        curent=q.top();
        viz[curent]=1;
        q.pop();
        for(i=0;i<G[curent].size();i++)
        {
            vecin=G[curent][i].first;
            cost=G[curent][i].second;
            if(dist[curent]+cost<dist[vecin])dist[vecin]=dist[curent]+cost;
            if(viz[vecin]==0){q.push(vecin);viz[vecin]=1;}
        }
    }
    for(i=2;i<=n;i++)
        if(dist[i]!=100001)g<<dist[i]<<' ';
    return 0;
}