By the inductive assumption, we may colour each of the smaller graphs with the three colours so that no edge joins vertices of the same colour, keeping fixed the colours of \(u\) and \(v\).  Pasting together the two smaller graphs as coloured gives us a 3-colouring of the whole graph.