It is well-known that the weak Bruhat order on the symmetric group on a finite number n of letters is a lattice, denoted by P(n) and often called the permutohedron on n letters, of which the Tamari lattice A(n) is a lattice retract. The equational theory of a class of lattices is the set of all lattice identities satisfied by all members of that class. We know from earlier work that the equational theory of all P(n) is properly contained in the one of all A(n). We prove the following results. Theorem I. The equational theory of all P(n) and the one of all A(n) are both decidable. Theorem II. There exists a lattice identity that holds in all P(n), but that fails in a certain 3338-element lattice. Theorem III. The equational theory of all extended permutohedra, on arbitrary (possibly infinite) posets, is trivial. In order to prove Theorems I and II, we reduce the satisfaction of a given lattice identity in a Cambrian lattice of type A to a certain tiling problem on a finite chain. Theorem I then follows from Büchi's decidability theorem for the monadic second-order theory MSO of the successor function on the natural numbers. It can be extended to any class of Cambrian lattices of type A with MSO-definable set of orientations.