Dominos 2

Dominos are lots of fun. Children like to stand the tiles on their sides in long lines. When one domino falls, it knocks down the next one, which knocks down the one after that, all the way down the line. Sometimes, though, a domino fails to knock the next one over, and it must be knocked down by hand to keep the chain going.

Given a set of dominos that are knocked down by hand, determine the total number of dominos that fall.

The dominos form a directed structure: some dominos, when they fall, cause specific other dominos to fall. A domino falls if it is knocked down by hand, or if some domino that has fallen causes it to fall (directly or through a chain). Count all of the dominos that end up fallen.

The first line contains an integer $T$, the number of test cases. Each test case begins with a line containing three integers $n$, $m$, $l$, each no larger than $10000$, followed by $m + l$ additional lines. Here $n$ is the number of dominos, numbered from $1$ to $n$. Each of the next $m$ lines contains two integers $x$ and $y$, meaning that if domino $x$ falls it also causes domino $y$ to fall. Each of the following $l$ lines contains a single integer $z$, meaning domino $z$ is knocked over by hand.

For each test case, output a single line containing one integer: the total number of dominos that fall.