You've correctly identified the most common way to establish a bijection between $G_1 \times H_1$ and $G_2 \times H_2$. Now you just have to go through the work of proving that $h$ is indeed a bijection. Luckily, showing that $h$ is one-to-one and onto are very short proofs relying on $f$ and $g$ being bijections.
As for the "morphism" part, I'll give names to the operations. Suppose $(G_1, *_1)$, $(G_2, *_2)$, $(H_1, +_1)$, and $(H_2, +_2)$ are the operational systems in question.
Let $\cdot_1$ be defined for all $(x,y),(z,w) \in G_1 \times H_1$ by $(x,y) \cdot_1 (z,w) = (x *_1 z, y +_1 w)$, and similarly for $\cdot_2$ with elements in $G_2 \times H_2$. (That is, $\cdot_1$ and $\cdot_2$ are the traditional componentwise operations.)
Let $(x,y),(z,w) \in G_1 \times H_1$. Then
h((x,y) \cdot_1 (z,w)) &= h((x *_1 z, y +_1 w)) \\
&= (f(x *_1 z), g(y +_1 w)) \\
&= (f(x) *_2 f(z), g(y) +_2 g(w)) \\
&= (f(x),g(y)) \cdot_2 (f(z), g(w)) \\
&= h((x,y)) \cdot_2 h((z,w))
and thus $h$ is a homomorphism. Together with it being a bijection, you get that $h$ is an isomoprhism.