Given the root of a tree where each node has a val and a children array, return all values in DFS (preorder) traversal.