Problem - Graph Valid Tree

Given $n$ nodes and a list of undirected edges, check if these edges form a valid tree. A valid tree must be:

$1.$ Connected (one component)

$2.$ Acyclic (exactly $n-1$ edges) Example: $n = 5$, edges $= [[0,1],[0,2],[0,3],[1,4]]$ is a tree. $n = 5$, edges $= [[0,1],[1,2],[2,3],[1,3],[1,4]]$ is not (has a cycle). Constraints: $n$ from $1$ to $2000$, edges from $0$ to $5000$.