#include<bis/stdc++>
using namespace std;
typedef pair<int,int>pii;
int nodecount,edgecount;
void dijkstra (int src,vector<vector<int>G[1005],int dist[])
{

    priority_queue<<pii,vector<pii>,greater<pii> >pq;
    pq.push({0,src});
    dist[src]=0;
    while(!pq.empty())
    {

int u=pq.top().second;
pq.pop();
int sz=G[u].size();
for(auto v : G[u]){
    
    int cost=dist[u]+v[1];
    if
}

    }


}
int  main ()
{




    return 0;
}