Polynomial-Time Algorithm for Finding Densest Subgraphs in Uncertain Graphs