Maximum path sum in an N-ary tree

Each node of an N-ary tree holds an integer. A path joins any two nodes through parent and child links and visits each node at most once. Return the largest path sum. Unlike the binary version, a node may have many children, so keep track of its two best child paths.