You can use binary search and dsu to solve this problem:

1) Use binary search for finding the maximum speed of Mary can drive O(logN).

2) Use dsu if Mary can reach to her grandmother if she drives her car to speed x O(N).

Total time complexity is O(NlogN).