Are there any Chosen left in Faerûn following the Second Sundering?

Throughout Toril’s history, its various deities have engaged in a practice of vesting mortals with power and purpose. Those mortals are sometimes called Chosen. The Sword Coast Adventurer’s Guide contains a number of references to Chosen — including their involvement in tumultuous events during the Second Sundering. See, e.g., p. 17 (“Throughout this period, tales began to spread of individuals who had been touched by the gods and granted strange powers. Some of these so-called Chosen were at the root of the conflicts that grip the land.”)

A couple of SCAG‘s references might be read to suggest that, after the Second Sundering, Chosen might have become a thing of the past. To wit:

  • p. 9, a description of an uprising in Calimshan led by a Chosen of Ilmater notes that the Chosen disappeared and that “[m]any pray for the return of the Chosen and the completion of his work.”
  • p. 12, a discussion of Mulhorand says “the Chosen of the gods began to appear in the last few years,” and then a few sentences later mentions that “the upheaval ended and the Chosen began to disappear . . . .”
  • p. 18, detailing the year 1489 D.R., notes that by then “the deities ceased interfering with the world through their Chosen. The gods were no longer silent but quiet, and in many places new priesthoods arose to interpret the gods’ now subtle signs.”
  • p. 45, a story about the grisly revelation “[j]ust a few years ago” that

None of these references mention any Chosen currently active in Faerûn. Several of them strongly imply that certain Chosen disappeared and have not reappeared.

Is there any evidence in first-party published materials that the Chosen are still a phenomenon in the post-Second Sundering world?

How to solve following tree problem with number assigned to each node?

I have a tree whose nodes have numbers assigned to them initially. A series of $ Q$ queries are asked from $ n=0$ to $ n=Q-1$ seconds. During end of each second numbers on a node (which are not leaf) are removed and gets transferred to each direct child node. Numbers on leaf node remain as it is and number coming from parent gets added to them. At each query it is possible that new number is added to a node. How to solve this efficiently?

Example: Suppose I have a tree 1—–2——3——-4 (1 is parent). Suppose at beginning numbers on nodes are 1, 2, 3, 4 respectively. Then at…

At zero second end 5 is added to node zero. At end of 0 seconds numbers on node are 5, 1, 2, 7. (Note 1 is not added to 5 because it is removed).

At one second end, 1 is added to node 4, then numbers are 0, 5, 1, 10. Fourth node has number 10 since it received 2 from parent node and 1 is added and 7 was present on it.

Now suppose at two second end, I am asked to tell number on 2nd node?Answer is 0.

I mean that in each query either a number can be added on a node or a question can be asked like – what is number on $ ith$ node?
How to solve this in less than $ O(nQ)$ . Where $ n$ is number of nodes and $ Q$ is number of queries?

Videos requires to install plugins to play media files of the following type: application/zip decoder

I have already tried installing ubuntu restricted extras, which didn’t work. It is also not playing in vlc.

Required plugin could not be found
Videos requires to install plugins to play media files of the following type: application/zip decoder

enter image description here