#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

#include<queue>

#define ll long long

#define inf 50000000

#define re register

using namespace std;

struct po

{

    int to,dis,nxt;

}edge[];

int head[],cur[],dep[],n,m,s,t,u,num=-,x,y,l,tot,sum,k;

inline int read()

{

    int x=,c=;

    char ch=' ';

    while((ch>''||ch<'')&&ch!='-')ch=getchar();

    while(ch=='-')c*=-,ch=getchar();

    while(ch<=''&&ch>='')x=x*+ch-'',ch=getchar();

    return x*c;

}

inline void add_edge(int from,int to,int dis)

{

    edge[++num].nxt=head[from];

    edge[num].to=to;

    edge[num].dis=dis;

    head[from]=num;

}

inline void add(int from,int to,int dis)

{

    add_edge(from,to,dis);

    add_edge(to,from,);

}

inline bool bfs()

{

    memset(dep,,sizeof(dep));

    queue<int> q;

    while(!q.empty())

    q.pop();

    dep[s]=;

    q.push(s);

    while(!q.empty())

    {

        int now=q.front();

        q.pop();

        for(re int i=head[now];i!=-;i=edge[i].nxt)

        {

            int v=edge[i].to;

            if(dep[v]==&&edge[i].dis>)

            {

                dep[v]=dep[now]+;

                if(v==t)

                return ;

                q.push(v);

            }

        }

    }

    return ;

}

inline int dfs(int u,int dis)

{

    if(u==t)

    return dis;

    int diss=;

    for(re int& i=cur[u];i!=-;i=edge[i].nxt)

    {

        int v=edge[i].to;

        if(dep[v]==dep[u]+&&edge[i].dis!=)

        {

            int check=dfs(v,min(dis,edge[i].dis));

            if(check>)

            {

                diss+=check;

                dis-=check;

                edge[i].dis-=check;

                edge[i^].dis+=check;

                if(dis==) break;

            }

        }

    }

    return diss;

}

inline int dinic()

{

    int ans=;

    while(bfs())

    {

        for(re int i=;i<=*n;i++)

        cur[i]=head[i];

        while(int d=dfs(s,inf))

        ans+=d;

    }

    return ans;

}

int main()

{

    memset(head,-,sizeof(head));

    n=read();m=read();k=read();

    s=;t=;

    for(re int i=;i<=m;i++)

    {

        x=read();y=read();

        if(x!=y)

        {

            add(x+n,y,inf);

            add(y+n,x,inf);

        }

    }

    for(re int i=;i<=k;i++)

    {

        x=read();

        add(s,x+n,inf);

    }

    for(re int i=;i<=n;i++)

    add(i,i+n,);

    cout<<dinic();

}