Graph Valid Tree.js

/**
 Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.

For example:

Given n = 5 and edges = [[0, 1], [0, 2], [0, 3], [1, 4]], return true.

Given n = 5 and edges = [[0, 1], [1, 2], [2, 3], [1, 3], [1, 4]], return false.

Hint:

    Given n = 5 and edges = [[0, 1], [1, 2], [3, 4]], what should your return? Is this case a valid tree?
    According to the definition of tree on Wikipedia: “a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.”

Note: you can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges. 
*/
/**
 * @param {number} n
 * @param {number[][]} edges
 * @return {boolean}
 */
var validTree = function(n, edges) {
    let nodes = [];
    
    for (let i = 0; i < n; i++) {
        nodes[i] = i;
    }
    
    for (let i = 0; i < edges.length; i++) {
        let start = edges[i][0];
        let end = edges[i][1];
        
        while (nodes[start] !== start) {
            start = nodes[start];
        }
        
        while (nodes[end] !== end) {
            end = nodes[end];
        }
        
        // cycle detected
        if (start === end) {
            return false;
        }
        
        nodes[start] = end;
    }
    // edges are enough to connect each node
    return edges.length >= n - 1;
};