Auto comment: topic has been updated by sujal22514 (previous revision, new revision, compare).

There are several issues:

1. Your BFS is wrong. When considering edge $$$(xy)$$$ you must check if $$$y$$$ was already visited, otherwise you might rewrite dis[y] with an incorrect value.
2. Your connected_bonus_of_size_atleast_2 function can be $$$O(nm)$$$, because for every edge you might iterate over all the neighbours of both endpoints which can be a lot. Instead, you should precalculate for every vertex whether there is a token in one of the neighbours.
3. In the description of your solution you said "for each bonus vertex find the number of token near it. and these would be the number of moves". That would be incorrect, because you could calculate one token several times. In the code you mark them as found which is correct. So the mistake is only in the description.

Since you are getting WA, it must be caused by the first issue. Unfortunately, fixing it makes the solution pass: 278699688, which means that the tests are weak, since the second issue is still there and it should get TL.