I was thinking on a problem and i figure out an interesting problem that i can't solve it so could you help me?
We have an undirected weighted graph and Q queries. Each query has two vertices u and v. For each query erase all of edges between one of the path from v to u, so that sum of all weight of edges that has been erased from all queries become maximized.
I have no idea about time complexity, so there is no limit for n and Q. And if you have seen this problem before please give me the URL.