Please be informed that the A* is having a heuristic function, that will greedily explore the tree that will select the most assuring branches.
Let's say if the cost for each edge is same, then A* only begins with the nodes that are at "distance 1" because they all have the least cost. A* searches the nodes at "distance 2" from the root node because of their least cost. Thus, it recursively, leads to BFS.
For more information, do refer to the Artificial Intelligence course.