You are given an undirected graph consisting of n vertices and m edges ($$$1 \leq n, m \leq 10^5$$$). Let $$$d(u, v)$$$ be the shortest distance between $$$u$$$ and $$$v$$$. What is the best algorithm to calculate $$$\sum_{1 \leq u < v \leq n} d(u, v)$$$?