## Problem 1: World of StarCraft

Billy, the king of video games, is (among other things) a top professional StarCraft II player. In light of his recent success as the only human to defeat the fearsome AlphaStar AI, he has received exclusive access to play the upcoming installment in the series, World of StarCraft. In a natural progression for the series, this is a massively multiplayer online role-playing game.

World of StarCraft features N (2 ≤ N ≤ 100,000) planets, numbered from 1 to N. Each planet is under the control of one of three races (Protoss, Terran, or Zerg), with the character Ri representing planet i's race (either "`P`" for Protoss, "`T`" for Terran, or "`Z`" for Zerg).

There are M (0 ≤ M ≤ 100,000) space routes running amongst the planets, with the i-th space route allowing one to travel in either direction between planets Ai and Bi (1 ≤ Ai, BiN, AiBi). There may be multiple space routes connecting a single pair of planets.

Despite its secretive and unreleased development status, World of StarCraft somehow already has an enormous player-base. Billy himself has K (1 ≤ K ≤ 100,000) friends in the game. His i-th friend is currently on planet Xi, and would like to reach a different planet Yi to complete an objective (1 ≤ Xi, YiN; XiYi).

When a player is on a planet i, they may travel along a space route to another planet j, assuming that a space route exists which connects planets i and j. However, due to open hostilities amongst the three races, it's only safe to do so if both planets are under the control of the same race (in other words, if Ri = Rj).

Billy would love to help all of his friends complete their objectives, but not without putting their in-game lives at risk! Help him determine how many friends i he has such that it's possible to safely travel through a sequence of planets beginning at planet Xi and ending at planet Yi.

In test cases worth 8/14 of the points, N ≤ 1000, M ≤ 1000, and K ≤ 1000.

### Input Format

The first line of input consists of three space-separated integers, N, M, and K.
The next line consists of characters, R1..N.
M lines follow, the i-th of which consists of two space-separated integers, Ai and Bi, for i = 1..M.
K lines follow, the i-th of which consists of two space-separated integers, Xi and Yi, for i = 1..K.

### Output Format

Output a single integer, the number of friends who can safely complete their objectives.

```6 7 3
PZZPPP
1 2
6 4
3 4
2 5
5 6
1 4
4 2
6 4
2 3
1 5
```

```2
```

### Sample Explanation

Billy's first friend can safely travel directly from planet 6 to planet 4 to complete their objective.

Billy's second friend may never safely reach planet 3.

Billy's third friend can safely travel through the sequence of planets 1 → 4 → 6 → 5.

Point Value: 10 (partial)
Time Limit: 3.00s
Memory Limit: 128M