Where does union-find stop being useful?

For connectivity in an undirected graph that only gains edges, union-find with path compression and union by rank handles a sequence of operations in amortized near-constant time per operation. It doesn't support edge deletions cleanly, so a changing graph needs a different approach.