Redundant Connection

A tree with n nodes (labelled 1..n) had one extra edge added. Given the n edges, print the edge that can be removed so the graph becomes a tree again. If several answers exist, print the one that appears last in the input.

3 <= n <= 1000