
import scala.annotation.tailrec

object Main extends App {


  val tmp = io.StdIn.readLine().split(' ').map(_.toInt)
  val (n, m) = (tmp(0), tmp(1))

  val tree = new IUnionFind(n)

  val t = io.StdIn.readLine().split(' ').map(_.toInt - 1)

  for(_ <- (1 to m)) {
    val ar = io.StdIn.readLine().split(' ').map(_.toInt - 1)
    val (x, y) = (ar(0), ar(1))
    tree.union(x, y)
  }

  val ans = t.zipWithIndex
    .count{
      case (x, i) => tree.connected(x, i)
    }

  println(ans)

  class IUnionFind(val size: Int) {

    private case class Node(var parent: Option[Int], var treeSize: Int)

    private val nodes = Array.fill[Node](size)(new Node(None, 1))

    def union(t1: Int, t2: Int): IUnionFind = {
      if (t1 == t2) return this

      val root1 = root(t1)
      val root2 = root(t2)
      if (root1 == root2) return this

      val node1 = nodes(root1)
      val node2 = nodes(root2)

      if (node1.treeSize < node2.treeSize) {
        node1.parent = Some(t2)
        node2.treeSize += node1.treeSize
      } else {
        node2.parent = Some(t1)
        node1.treeSize += node2.treeSize
      }
      this
    }

    def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2)

    private def root(t: Int): Int = nodes(t).parent match {
      case None => t
      case Some(p) =>
        val tmp = root(p)
        nodes(t).parent = Some(tmp)
        tmp
    }
  }
}
