1class Solution:
2    def findCenter(self, edges: List[List[int]]) -> int:
3        u1, v1 = edges[0]
4        u2, v2 = edges[1]
5        if u1 == u2 or u1 == v2:
6            return u1
7        return v1
8

1using System.Collections.Generic;

public class Solution {
    public int FindCenter(int[][] edges) {
        Dictionary<int, int> count = new Dictionary<int, int>();
        foreach (var edge in edges) {
            int u = edge[0], v = edge[1];
            if (!count.ContainsKey(u)) count[u] = 0;
            if (++count[u] > 1) return u;
            if (!count.ContainsKey(v)) count[v] = 0;
            if (++count[v] > 1) return v;
        }
        return -1; // Should not be reached
    }
}