Spherical $G$-parking functions are a distinguished subset of standard monomials, arising from the skeleton ideals of the $G$-parking function ideal. Explicit spherical $G$-parking function enumeration formulas are known only in a few classes of graphs. In this paper, we consider a family of graphs $\Gl$ ($1\leq \ell \leq n-2$), obtained from the complete bipartite $K_{n+1}$ by deleting the $\ell$ edges joining vertex $1$ to the vertices in $F_\ell= \{n-\ell+1, \ldots, n\}$. The uprooted spanning trees of $\Gl-\{0\}$ are counted by the set $\UnFl$ of uprooted trees with the vertex set $[n]$ in which vertex $1$ is not adjacent to any vertex in $F_\ell$, and we establish that $|\UnFl| = (n-1)^{n-\ell-2}(n-2)^{\ell}(n-\ell-1).$ We derive this formula combinatorially and independently recover it as an application of the matrix tree theorem, obtaining some combinatorial identities as consequences. Finally, we determine the number of spherical $\Gl$-parking functions as $|\SPF(\Gl)| = (n-1)^{n-3}(n-\ell-1)^2.$