Given an array edges where each element edges[i] = [ui, vi] represents an edge between nodes ui and vi in an undirected star graph,A star graph is a graph where one central node is connected to every other node. If there are n nodes, then the central node must be connected to all other n-1 nodes. find the central node of this star graph.

Note: A star graph is a graph where one central node is connected to every other node. This implies that a star graph with n nodes has exactly n - 1 edges.

Constraints:

• $3 \leq$ n $\leq 10^3$

• edges.length $==$ n - 1

• edges[i].length $== 2$

• $1 \leq$ ui, vi $\leq$ n

• ui $\neq$ vi

• The given edges represent a valid star graph.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.