#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
FILE *f, *g;
class compar
{
    public:
        bool operator() (pair <int,int> x, pair <int,int> y)
        {
            return(x.second > y.second);
        }

};
priority_queue <pair <int,int>, vector <pair <int,int> >,compar> coada;
vector <pair <int,int> > v[50002];
bool fr[50002];
int drum[50002];
void read()
{
    fscanf(f,"%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        fscanf(f,"%d %d %d",&x,&y,&c);
        v[x].push_back({y,c});
    }
}
void dijkstra()
{
    for(int i=1;i<=n;i++)
        drum[i]=99999999;
    q.push({1,0});
    while(!q.empty())
    {
        nod=q.top().first;
        q.pop
    }
}
int main()
{
    f=fopen("dijkstra.in","r");
    g=fopen("dijkstra.out","w");
    read();


    fclose(f);
    fclose(g);
    return 0;
}