#include<fstream>
#include<vector>
#include<utility>
#include<queue>
int n,m,a,b,c,d[50001];
bool compare(pair<int,int> x,pair<int,int> y)
{
    return x.c<y.c;
}
priority_queue<pair<int,int>,vector<pair<int,int> >,compare>q;
vector<pair<int,int>> v[50001];
void dijkstra()
{
    pair<int,int> aux;
    while(q.empty()==0)
    {
        aux=q.top();
        q.pop();
        if(d[aux.first]>aux.second&&aux.first!=1)
        {
            d[aux.first]=aux.second;
            for(vector<pair<int,int> >::iterator i=v[q.first].begin();i!=v[q.first].end();i++)
            {
                q.push(v[i].first,v[i].second+d[aux.first]);
            }
        }
    }
}
int main()
{
    ifstream is("dijsktra.in");
    ofstream os("dijsktra.out");
    is>>n>>m;
    for(i=1;i<=m;i++)
    {
        is>>a>>b>>c;
        aux.a=a,aux.b=b,aux.c=c;
        v[a].push(make_pair(b,c));
    }
    for(vector<pair<int,int> >::iterator i=v[1].begin();i!=v[1].end();i++)
    {
        q.push(make_pair((*i).first,(*i).second);
    }
    for(i=1;i<=n;i++)
    d[i]=50000000;
    dijkstra();
    for(i=2;i<=n;i++)
    os<<d[i];
}