Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs