**GUESSFORCES**

void dijkstra(int src) {
   dis[src] = 0;
   priority_queue<vector<int>, vector<vector<int>>, greater<>> pq;
   pq.push({0, src, 1});
   while (!pq.empty()) {
      int cur = pq.top()[1], d = pq.top()[0], lvl = pq.top()[2];
      pq.pop();
      if (d > dis[cur])
         continue;
      dis[cur] = d;
      for (auto &i : G[cur]) {
         if (dis[i.first] > d + i.second * lvl) {
            dis[i.first] = d + i.second * lvl;
            pq.push({dis[i.first], i.first, lvl + 1});
         }
      }
   }
}