As the trees are combined, the semantics is the union of their semantics modulo unification.
given the grammar and the derivation shown, the semantics of John often runs is as shown namely, named(j john), run(a,j), often(a).