In addition to the instantaneous description, each node contains a record of the alternatives previously tried (the edges to its child nodes in the tree) with their corresponding probabilities, plus a ranked list of the alternatives not yet tried.
we maintain the probability mass left unexplored in a node: the sum of the probabilities of the actions not yet tried.