Preorder Traversal Without Invalid Nodes

You are given a rooted tree with n nodes labeled from 0 to n - 1, represented by directed edges edges, where edges[i] = [parent, child].