If the graph is a tree with N vertices and N-1 edges, it may be easier to think if the appropriate vertex is [Converted to rooted tree
I think it’s because you get to use concepts like parent, ancestor, least common ancestor, height, etc., as opposed to thinking vaguely in terms of graphs.
This page is auto-translated from /nishio/グラフが木なので根つき木に変換 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.