Every graph has a subtle invariant, called its sandpile group: a finite abelian group whose size is the number of spanning trees in the graph. After reviewing this, we will discuss an analogous "sandpile group" for any representation of a finite group, motivated in part by the classical McKay correspondence.