#include <vector>
#include <queue>
#include <stdio.h>
#include <bitset>
#define M 250005
#define N 50001
using namespace std;
int n , m;
vector < pair <int><int> > cost[N];
priority_queue < pair <int><int> > Q;
bitset vis[N];

void read()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    int x, y ,c ;
    for(int i = 0 ; i < m ; i++)
    {
        scanf("%d %d %d\n",&x,&y,&c);
        cost[make_pair(x,y)].push_back[c];
    }
}

void dijkstra(int nod)
{
  q.push_back(make_pair());

}


int main()
{
    read();
    return 0;
}