#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

#define infinit 1000000000
#define nmax 50010

int n,m,x,y,c,nod,vecin,cost,lg,ap[nmax],d[nmax];
vector<pair<int,int> > a[nmax];
queue<int> q;
bitset<nmax> v;

int main()
{
    int i,j;
    cin>>n>>m;
    for (i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
    }
    for (i=2;i<=n;i++)
        d[i]=infinit;
    v.set(1);
    q.push(1);
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        v.reset(1);
        lg=a[nod].size();
        for (i=0;i<lg;i++)
        {
            vecin=a[nod][i].first;
            cost=a[nod][i].second;
            if (d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
                if (v.test(vecin)==false)
                {
                    ap[vecin]++;
                    v.set(vecin);
                    q.push(vecin);
                }
            }
        }
    }
    for (i=2;i<=n;i++)
        cout<<(d[i]==infinit?0:d[i])<<" ";
}