Characteristic polynomials of trees and E8 In thinking about constructing manifolds via surgery or plumbing, the following combinatorial problem comes up:
If T is a tree with adjacency matrix A and I is the identity matrix of the same order, when is |det(A-I)| = 1 possible? The fact that this is true for the E8 tree allows us to construct  manifolds following Milnor et al. I've thought about this problem a bit and can't see an obvious reduction to similar problems, involving root systems, etc. 
 Can it be shown that no other examples exist? What simple argument am I missing?
A correction after the comments I got below - I originally put |det(A-I)|=1 but actually meant |det(A+2I)|=1 or equivalently |det(A-2I)|=1 since trees are bipartite and their eigenvalues are symmetric around 0. Chris's observation is interesting as well... I now have to go back and do some rechecking of small trees. ::::grin::::
 A: According to sage, there are 7 trees (out of 23) on 8 vertices with $\det(A-I)=\pm1$
and 20 (out of 47) on 9 vertices. So it seems that the condition is satisfied easily.
A: Using sage, and up to 16 vertices included, one finds only two trees satisfying $|det(A+2I)|=1$, namely $E_8$ and $E_{10}$.
EDIT: I also confirm that there are 18 such trees with 18 vertices. Here they are in the graph6 string notation (suitable for input in sage):
['Q??GOGA?O??C?AGAA?C???@d?O_',  'Q??GOGA?O@?A?A?@G?C??G?gO@O',
 'Q???GGA?O@??_?O?C???kC@OGG_',  'Q???GGA?O??C_AO?C???oC@OG?o',
 'Q??GOGA?O??C?C?AG@C??G@COB?',  'Q???G???OG?COCGAO??F?C?GGCG',
 'Q????CA??O?_O?G??AO@aCPA?G_',  'Q????CA?O?O?O?G??D_GaCA?GAG',
 'Q???GGA?O@???@_?G??OSG@OOO_',  'Q???GGA??A?A?GGCO?A??A?cOK_',
 'Q???GGA??A?A?GOCO??ODGA?OCG',  'Q????G??_??@OGGOO??L?CE?GC_',
 'Q????C???Q?_O?G??AO@aCHAA?_',  'Q????C???_@G@GO??AG@_G_E?G_',
 'Q????_G@?C???B_?G?H?`?P??`G',  'Q???G??@?C?GOGG?O??BACCGGK?',
 'Q????GA????@?DG?A@?OBOKA@@?',  'Q????GAA???@?C_?G?G_HGQ??b?']

For example, you can type Graph('Q????GAA???@?C_?G?G_HGQ??b?') to get the last one.
A: What about $A_p$, $p\ne2\bmod 3$? It looks like you are considering the graph lattice with weights of the vertices equal to $-1$, and you want the result unimodular. There are lots of such graphs; the very first thing one can see is that one can always extend any leaf by~$3$. For the classification, try to mimic blow-down of $(-1)$-curves, i.e., splitting off orthogonal summands generated by vectors of square $(-1)$. In fact, this is done somewhere (in conjunction with plumbings), but I do not remember the reference :(
