We study the problem of query evaluation over tuple-independent probabilistic databases. We define a new characterization of lineage expressions called "acyclic disjoint branch", present methods to compute their probability and discuss their complexity. This work extends the class of lineage expressions for which evaluation can be performed in PTIME. We achieve this extension with a novel usage of junction trees to compute the probability of these lineage expressions.