diff --git a/java/261-Graph-Valid-Tree.java b/java/261-Graph-Valid-Tree.java
index 5c1e8226a..f55511370 100644
--- a/java/261-Graph-Valid-Tree.java
+++ b/java/261-Graph-Valid-Tree.java
@@ -18,7 +18,7 @@ public boolean validTree(int n, int[][] edges) {
 
         Set<Integer> visited = new HashSet<>();
 
-        return depthFirstSearch(0, -1, visited) && visited.size() == n;
+        return depthFirstSearch(edges[0][0], -1, visited) && visited.size() == n;
     }
 
     private boolean depthFirstSearch(