#include <stdio.h>
#include <vector>
#include <queue>
#define inf 1000000000
using namespace std;
int n,m,i,x,y,c,d[50001];
vector<pair<int,int> > G[50001];
class comp
{
public:
    bool operator()(int a,int b)
    {
        return d[a]>d[b];
    }
};
priority_queue<int, vector<int>, comp> Q;
void dijkstra()
{
    int i,x,z;
    for (i=2;i<=n;i++) d[i]=inf;
    Q.push(1);
    while (!Q.empty())
    {
        x=Q.top();
        Q.pop();
        z=G[x].size();
        for (i=0;i<z;i++)
            if (d[G[x][i].first]>d[x]+G[x][i].second)
        {
            d[G[x][i].first]=d[x]+G[x][i].second;
            Q.push(G[x][i].first);
        }
    }
}
int main()
{
    freopen ("dijkstra.in","r",stdin);
    freopen ("dijkstra.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i%i",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
        G[y].push_back(make_pair(x,c));
    }
    dijkstra();
    for (i=2;i<=n;i++) printf("%i ",d[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}