Summary: Using two graph invariants arising from F. Chung and S. T. Yau’s [J. Comb. Theory, Ser. A 91, No. 1–2, 191–214 (2000; Zbl 0963.65120)] discrete Green’s function, we derive explicit formulas and new estimates of hitting times of random walks on weighted graphs through the enumeration of spanning trees.