#include<cstdio>
#include<vector>
#include<queue>
#define M 1<<30
using namespace std;
FILE *f=fopen("dijkstra.in","r");
FILE *g=fopen("dijkstra.out","w");
struct nod{
    int inf,c;
};
vector<nod>v[50001];
int cost[50001],viz[50001],n,m,t[100];
struct cmp{
    bool operator()(nod a,nod b)
    {
        if(cost[a.inf]>cost[b.inf])
            return true;
        else return false;
    }
};
priority_queue<nod,vector<nod>,cmp>heap;
void citire()
{
    int i,x,y,z;
    nod a;
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        fscanf(f,"%d%d%d",&x,&y,&z);
        a.inf=y;
        a.c=z;
        v[x].push_back(a);
    }
}
void dijkstra()
{
    nod a,nodcur;
    int i;
    for(i=2;i<=n;i++)
        cost[i]=M;
    a.inf=1;a.c=0;heap.push(a);
    while(!heap.empty())
    {
        nodcur=heap.top();
        heap.pop();
        viz[nodcur.inf]=1;
        for(i=0;i<v[nodcur.inf].size();i++)
            if(cost[v[nodcur.inf][i].inf]>cost[nodcur.inf]+v[nodcur.inf][i].c)
                {
                    cost[v[nodcur.inf][i].inf]=cost[nodcur.inf]+v[nodcur.inf][i].c;
                       heap.push(v[nodcur.inf][i]);
                    t[v[nodcur.inf][i].inf]=nodcur.inf;
                }
    }
    for(i=2;i<=n;i++)
        if(cost[i]==M)
            fprintf(g,"0 ");
        else
            fprintf(g,"%d ",cost[i]);
    fprintf(g,"\n");
    for(i=1;i<=n;i++)
        fprintf(g,"%d ",t[i]);
}
int main()
{
    citire();
    dijkstra();
}