All trees considered so far have been binary, but one can envisage ternary trees that, in their rooted form, have three branches descending from a branch node. The unrooted trees therefore have four edges radiating from every branch node. If there are $m$ branch nodes in an unrooted ternary tree, how many leaves are there and how many edges?