In two sets, identify set of pairs with maximal sum of connections
This is the assignment problem.  There are standard algorithms, such as the "Hungarian algorithm".

If you want to only include edges whose weight is below some threshold, delete those edges first before running the algorithm.