  Motivated by the problem of counting finite BPS webs, we count certain
immersed metric graphs, tripods, on the flat torus. Classical Euclidean
geometry turns this into a lattice point counting problem in $\mathbb C^2$, and
we give an asymptotic counting result using lattice point counting techniques.
