OJ Board

My strategy is the following:


Sort edges in decreasing order
For each edge that connects two different components, check if each component is a candidate (this edge less than min edge in the component and size > 1), if so, add its size. Join the components.
Update the min size of the new ...

I keep getting WA, but it passes all the tests in uDebug. Can somebody give me a hint on what's wrong?


if __name__ == '__main__':
n = int(input())
for i in range(1, n + 1):
print("Case #", i, ":", sep = "")
f1 = set(input().split()[1:])
f2 = set(input().split()[1:])
f3 = set(input().split ...

I cannot find the error in this code. I keep getting WA even though I can pass all test cases I've thought of. Can somebody give me a hand? Preferably by posting some test case that doesn't work.