#include<fstream>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
vector<pair<int,int> > v[50001];
struct triplet
{
    int x,y,c;
};
triplet c_t(int x,int y,int c)
{
    triplet pass;
    pass.x=x,pass.y=y,pass.c=c;
    return pass;
};
class queue_C
{
public:
    bool operator () (triplet a,triplet b)
    {
        return a.c>b.c;
    }
};
priority_queue<triplet,vector<triplet >,queue_C> q;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,l[50001],pret[50001],i,x,y,c,ok;
triplet aux;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
        if(x==1)
            q.push(c_t(x,y,c)),l[y]=1;
        if(y==1)
            q.push(c_t(y,x,c)),l[x]=1;
    }
    pret[1]=-1;
    while(!q.empty())
    {
        aux=q.top();
        q.pop();
        while(pret[aux.y]!=0)
        {
            if(q.empty())
            {
                ok=1;
                break;
            }
            aux=q.top();
            q.pop();
        }
        if(ok==1)break;
        pret[aux.y]=aux.c;
        l[aux.y]=aux.x;
        for(vector<pair<int,int> >::iterator i=v[aux.y].begin(); i!=v[aux.y].end(); i++)
        {
            if(pret[(*i).first]==0)
                q.push(c_t(aux.y,(*i).first,pret[aux.y]+(*i).second));
        }
    }
    for(i=2; i<=n; i++)
        fout<<pret[i]<<' ';
    return 0;
}