Can two ordered sequences be merged into one order?

You get two arrays of integer labels. Each array sets ordering rules: a label must come before every label that follows it in the same array. Decide whether one ordering exists that contains each distinct label from either array exactly once and keeps the rules of both arrays.