Trees · Hard problem

A tree $T$ has vertices $1, \ldots, 7$ and edges $12, 13, 14, 15, 26, 37$. For how many of the pairs of non-adjacent vertices in $T$ does joining them with a new edge create a $3$-cycle (a triangle)?