This joint work with Nick Ovenhouse and Haihan Wu. Kasteleyn's theorem shows how to count dimer covers of a planar graph G with the Pfaffian of an associated adjacency-type matrix. For a graph G with connection taking values in SL(n), SO(n), or Sp(2n) we extend Kasteleyn's theorem to count traces of ""multiwebs"" in G.