#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define inf 2000000000
#define nmax 50002
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct nod{
    int vec,co;
};

class cmp{
public:
    bool operator()(nod A,nod B)
    {
        return A.co>B.co;
    }
};

vector <nod> graf[nmax];
priority_queue <nod,vector<nod>,cmp> coada;
bitset <nmax> viz;
int dist[nmax],n,m,x,y,z,c;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        dist[i]=inf;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        graf[x].push_back({y,c});
        graf[y].push_back({x,c});
    }
    dist[1]=0;
    coada.push({1,0});
    while(!coada.empty())
    {
        int nod=coada.top().vec;
        int cost=coada.top().co;
        coada.pop();
        int lg=graf[nod].size();
        if(viz[nod]==0)
        {
            for(int i=0;i<lg;i++)
            {
                int vecin=graf[nod][i].vec;
                int cos=graf[nod][i].co;
                if(dist[vecin]>cos+cost)
                {
                    dist[vecin]=cos+cost;
                    coada.push({vecin,dist[vecin]});
                }
            }
        }
        viz[nod]=1;
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==inf)
            dist[i]=0;
        fout<<dist[i]<<" ";
    }
    return 0;
}