#include <iostream>
#include <queue>
#include <cstdio>
#include <vector>
#include <utility>
#include <math.h>
#include <stdlib.h>

using namespace std;

priority_queue <int> coada1[50000];
vector <pair <int,int> > v[50000];
vector <pair <int,int> > ::iterator it;
vector <int> viz;

int n,m,x,y,z;

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        v[x].push_back(std::make_pair(y,z));
        if(x==1)
            coada1[y].push(-z);

    }
    for(int i=1;i<n;i++)
    {
        //for(it=v[i].begin();it!=v[i].end();++it)
          //  coada1[i].push(-(abs(coada1[i].top()+(*it).second)));
    }

    return 0;
}