Frog Position After T Seconds

Statement

You are given an undirected tree with n vertices labeled from $1$ to $n$. A frog starts at vertex $1$, at time $0$, and makes one move per second.

At each step, the frog follows these rules:

1. Move to an unvisited neighbor:
   If the frog has unvisited neighbors, it jumps to one of them, chosen uniformly at random (equal probability for each choice).

2. No revisiting:
   The frog can not jump back to a vertex it has already visited.

3. Stay when stuck
   The frog will keep jumping at its current vertex if there are no unvisited neighbors.

The tree is represented as an array of edges, where edges[i] = [$a_i$ ...