Roads

Given a weighted, undirected graph G of n vertices and m edges, we say that there is a road from vertex A to vertex B if for a given value r, there exists at least one path from A to B such that the minimum weight edge on the path is at least r. You would be given q queries, each of them is a value of r. For each query, output a single integer, the number of distinct, un-ordered pair of vertice