from kata_201 import DSU

def first_redundant_edge(n, edges):
    dsu = DSU(n)
    for a, b in edges:
        if not dsu.union(a, b):
            return (a, b)
    return None