Given the root of a binary tree and two values `p` and `q` that both exist in it, return the value of their lowest common ancestor (the deepest node that has both as descendants, where a node can be a descendant of itself).