Hello Codeforces,

I have a graph question where both edge addition and deletion are allowed as queries.After each query, you need to maintain the component each vertex is a part of.The addition query is straight-forward merge but i don't know how to implement edge deletion query. Can anyone explain or provide any link to an article which address this problem? Basically, i'm looking for this- Problem