If a graph $G$ is represented by the adjacency matrix $A$, how can one determine the number of paths of length 2 between two distinct vertices $u$ and $v$?