{-# OPTIONS_GHC -O #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ViewPatterns #-}

import Control.Monad
import Data.List
import qualified Data.ByteString.Char8 as B
import qualified Data.Vector.Storable as V
import qualified Data.Vector.Storable.Mutable as MV
import qualified Data.IntMap as M
import qualified Data.Set as S

findUF :: MV.IOVector Int -> Int -> IO Int
findUF uf x = do
    p <- MV.unsafeRead uf x
    if p == -1
        then return x
        else do
                f <- findUF uf p
                MV.unsafeWrite uf x f
                return f

gp :: M.IntMap (S.Set Int, S.Set Int) -> V.Vector Int -> MV.IOVector Int -> Int -> Int -> IO (M.IntMap (S.Set Int, S.Set Int))
gp am _ _ n i | n==i = return am
gp am ps uf n i = do
    -- index iのroot (0..)
    ri <- findUF uf i
    let r = if ri == -1 then i else ri
    -- root indexをキーとして、(index, pi)をグルーピング
    let um = case M.lookup r am of
                Just (gis, gps) -> M.insert r (S.insert i gis, S.insert (ps V.! (i-1)) gps) am
                Nothing -> M.insert r (S.singleton i, S.singleton $ ps V.! (i-1)) am
    --
    gp um ps uf n (i+1)

main = do
    [n,m] <- map read.words <$> getLine

    -- 順列読込 / ByteString -> Vector.Storable
    ps <- V.unfoldr (B.readInt.B.dropWhile (==' ')) <$> B.getLine

    -- (xi, yi)をUnionFind -> Vector.Storable.Mutable
    uf <- MV.replicate (n+1) (-1)
    replicateM_ m $ do
        [x,y] <- unfoldr (B.readInt.B.dropWhile (==' ')) <$> B.getLine
        px <- findUF uf x
        py <- findUF uf y
        when (px /= py) $ MV.unsafeWrite uf py px
    
    -- UnionFind木の根をkeyとして、(indexのSet, PiのSet)のMap
    ms <- gp M.empty ps uf (MV.length uf) 1

    -- Mapの各keyについて、indexのSetとPiのSetの重複の数の合計
    print $ sum $ M.map (\(s1,s2) -> intnum s1 s2) ms

-- setの重複の数
intnum s1 s2 = length $ S.intersection s1 s2