A variant of hitting set problem? Is this also a NP-hard problem?
The special case of your variant where every set $S_i$ contains only single-element sets are exactly the standard hitting set problem, so this variant is at least harder than the standard hitting set problem, thus is NP-hard.