diff --git a/TangDou/Topic/HuanGenDp/CF1406C.cpp b/TangDou/Topic/HuanGenDp/CF1406C.cpp
index 3cc8af8..82ca3c7 100644
--- a/TangDou/Topic/HuanGenDp/CF1406C.cpp
+++ b/TangDou/Topic/HuanGenDp/CF1406C.cpp
@@ -10,9 +10,8 @@ void add(int a, int b, int c = 0) {
     e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
 }
 
-vector<int> g[N]; // 邻接表，存图
-int sz[N];        // sz[i]:以i为根的子树中节点个数
-int son[N];       // son[i]:去掉节点i后，剩下的连通分量中最大子树节点个数
+int sz[N];  // sz[i]:以i为根的子树中节点个数
+int son[N]; // son[i]:去掉节点i后，剩下的连通分量中最大子树节点个数
 int r1, r2, n;
 
 void dfs(int u, int fa) {
@@ -56,18 +55,13 @@ signed main() {
         for (int i = 1; i < n; i++) { // n-1条边
             int x, y;
             cin >> x >> y;
-            g[x].push_back(y);
-            g[y].push_back(x);
             add(x, y), add(y, x);
         }
 
         dfs(1, 0); // 以1号点为入口，它的父节点是0
 
         if (!r2) {
-            int r3 = g[r1][0];
-
-            // cout << "r3=" << r3 << " " << e[h[r1]] << endl;
-
+            int r3 = e[h[r1]];
             cout << r1 << " " << r3 << endl;
             cout << r1 << " " << r3 << endl;
         } else {