#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using pii = pair<int, int>;
const int N = 5010, SZ = (1 << 18) + 5;
static char buf[SZ], *bgn = buf, *til = buf;
char getc() {
    if(bgn == til)  bgn = buf, til = buf + fread(buf, 1, SZ, stdin);
    return bgn == til ? EOF : *bgn++;
}
template<typename T>
void read(T &x) {
    char ch = getc();  T fh = 0;   x = 0;
    while(ch < '0' || ch > '9')    fh |= (ch == '-'), ch = getc();
    while(ch >= '0' && ch <= '9')   x = x * 10 + ch - '0', ch = getc();
    x = fh ? -x : x;
}
template<typename Type, typename... argc>
void read(Type &x, argc &...args)   {read(x), read(args...);}
template<typename T>
void print(T x) {
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
int n, u, v, a[N], cnt, fr[N], vis[N], fa[N], bk[N], tmp[N], ans, sum, book[N], nxt[N], val[N], dis[N], que[N], hh, tt, idx;
vector<int> edge[N], cir[N], has[N], in[N];
void clear() {
    for(int i = 1; i <= cnt; ++i)   cir[i].clear(), has[i].clear(), in[i].clear();
    for(int i = 1; i <= n; ++i) fr[i] = vis[i] = book[i] = 0, edge[i].clear();
    cnt = ans = sum = idx = 0;
}
struct DSU {
    int sum[N], pa[N];
    void init() {for(int i = 1; i <= n; ++i)    sum[i] = 0, pa[i] = i;}
    pii find(int x) {
        if(pa[x] == x)  return {x, 0};
        pii res = find(pa[x]);  pa[x] = res.fi, sum[x] += res.se;   return {res.fi, sum[x]};
    }
    void merge(int x, int y, int v) {
        if(!x || !y)    return;
        x = find(x).fi, y = find(y).fi;
        if(x != y)  pa[x] = y, sum[x] += v;
    }
}dsu, pnt;
void dfs(int x, int fath) {
    fa[x] = fath;
    for(int y : edge[x])    if(y != fath)   dfs(y, x);
}
void bfs(int str) {
    hh = 1, tt = 0;
    memset(dis, 0x3f, sizeof(dis)); 
    for(int st : in[str])
        for(int x : has[st])    if(dis[x])   que[++tt] = x, dis[x] = 0;
    while(hh <= tt) {
        int x = que[hh++];
        auto [t, v] = dsu.find(fr[x]);  v = pnt.find(fr[x]).se;
        if(book[fr[x]] && t != str) {
            if(val[t] > dis[x] - v) val[t] = dis[x] - v, nxt[t] = str;
        }
        for(int y : edge[x])    
            if(dis[y] > dis[x] + 1) dis[y] = dis[x] + 1, que[++tt] = y;
    }
}
void mst() {
    dsu.init(), pnt.init(), idx = cnt;
    int num = cnt;
    for(int i = 1; i <= cnt; ++i)   book[i] = 1, in[i].pb(i);
    book[1] = 0;
    while(num > 1) {
        for(int i = 1; i <= idx; ++i)   val[i] = N, nxt[i] = 0;
        for(int i = 1; i <= idx; ++i) if(dsu.find(i).fi == i)   bfs(i);
        memset(vis, 0, sizeof(vis)), memset(bk, 0, sizeof(bk));
        // for(int i = 1; i <= idx; ++i)   
        //     if(dsu.find(i).fi == i)    cerr << nxt[i] << " " << val[i] << " " << "\n";
        int ct = 0, pre = idx;
        num = 0;
        for(int i = 1; i <= idx; ++i)   tmp[i] = dsu.find(i).fi;
        for(int i = 2; i <= pre; ++i)   if(dsu.find(i).fi == i && !vis[i]) {
            int x = i, las = x;  ++ct;
            while(x && !vis[x]) dsu.merge(x, nxt[x], 0), sum += nxt[x] ? val[x] : 0, vis[x] = ct, las = x, x = nxt[x];
            if(x && vis[x] == ct) {
                int nw = nxt[x];    ++idx, tmp[idx] = idx, ++num;
                while(nw != x)  dsu.merge(nw, idx, 0), bk[nw] = 1, pnt.merge(nw, idx, val[nw]), nw = nxt[nw];
                dsu.merge(x, idx, 0), bk[x] = 1, pnt.merge(x, idx, val[x]);
            }
            else if(!x) bk[las] = 1, ++num;
        }
        for(int i = 1; i <= idx; ++i)   in[i].clear();
        for(int i = 1; i <= cnt; ++i)   in[dsu.find(i).fi].pb(i);
        // for(int i = 1; i <= idx; ++i)   if(dsu.find(i).fi == i) ++num;
        // for(int i = 1; i <= idx; ++i)   cerr << bk[i] << " ";
        // cerr << "\n";
        for(int i = 2; i <= cnt; ++i)   if(book[i] && !bk[tmp[i]])   book[i] = 0;
        // for(int i = 1; i <= idx; ++i)   cerr << dsu.find(i).fi << " ";
        // cerr << "\n" << num << "\n";
        // for(int i = 1; i <= cnt; ++i)   cerr << book[i] << " ";
        // cerr << "\n";  
    }
}
void mian() {
    read(n), clear();
    for(int i = 1; i <= n; ++i) read(a[i]);
    for(int i = 1; i < n; ++i)  read(u, v), edge[u].pb(v), edge[v].pb(u);
    for(int i = 1; i <= n; ++i) if((i == 1 || i != a[i]) && !vis[i]) {
        ++cnt;  int x = i;
        while(a[x] != i)    cir[cnt].pb(x), x = a[x];
        cir[cnt].pb(x);
        for(int j : cir[cnt])   vis[j] = 1, fr[j] = cnt;
    }
    for(int i = 1; i <= cnt; ++i) {
        cir[i].pb(cir[i][0]);
        memset(vis, 0, sizeof(vis));
        for(int j = 0; j + 1 < cir[i].size(); ++j) {
            dfs(cir[i][j + 1], 0);
            for(int x = cir[i][j]; x; x = fa[x]) {
                ++ans;
                if(!vis[x]) vis[x] = 1, has[i].pb(x);
            }
            --ans;
        }
    }
    // cerr << cnt << "\n";
    mst();
    // cerr << ans << " " << sum << "\n";
    print(ans + sum * 2), putchar('\n');
}
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #else
        // freopen("classic.in", "r", stdin);
        // freopen("classic.out", "w", stdout);
    #endif
    int T = 1;  // read(T);
    while(T--)  mian();
    return 0;
}