#include<stdio.h>

 #include<string.h>

 #include<algorithm>

 #include<cstdlib>

 #include<math.h>

 //#include<iostream>

 using namespace std;

 int n,m,p;

 #define maxn 6011

 #define maxm 100011

 const int inf=0x3f3f3f3f;

 struct Network

 {

     struct Edge{int to,next,cap,flow;}edge[maxm];

     int first[maxn],le,n;

     void clear(int n)

     {

         memset(first,,sizeof(first));

         le=;this->n=n;

     }

     void in(int x,int y,int cap)

     {

         Edge &e=edge[le];

         e.to=y;e.cap=cap;e.flow=;

         e.next=first[x];first[x]=le++;

     }

     void insert(int x,int y,int cap)

     {

         in(x,y,cap);

         in(y,x,);

     }

     int s,t,que[maxn],head,tail,dis[maxn],cur[maxn];

     bool bfs()

     {

         memset(dis,,sizeof(dis));

         dis[s]=;

         que[head=(tail=)-]=s;

         while (head!=tail)

         {

             const int now=que[head++];

             for (int i=first[now];i;i=edge[i].next)

             {

                 Edge &e=edge[i];

                 if (e.cap>e.flow && !dis[e.to])

                 {

                     dis[e.to]=dis[now]+;

                     que[tail++]=e.to;

                 }

             }

         }

         return dis[t];

     }

     int dfs(int x,int a)

     {

         if (x==t || !a) return a;

         int flow=,f;

         for (int &i=cur[x];i;i=edge[i].next)

         {

             Edge &e=edge[i];

             if (dis[e.to]==dis[x]+ && (f=dfs(e.to,min(a,e.cap-e.flow)))>)

             {

                 e.flow+=f;

                 edge[i^].flow-=f;

                 flow+=f;

                 a-=f;

                 if (!a) break;

             }

         }

         return flow;

     }

     int Dinic(int s,int t)

     {

         this->s=s,this->t=t;

         int flow=;

         while (bfs())

         {

             for (int i=;i<=n;i++) cur[i]=first[i];

             flow+=dfs(s,0x3f3f3f3f);

         }

         return flow;

     }

 }g;

 int x,y;int vis[maxn];

 int main()

 {

     scanf("%d%d%d",&n,&m,&p);

     g.n=(n<<)^;int s=g.n,t=;

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

     {

         scanf("%d%d",&x,&y);

         g.insert(x+n,y,inf);

         g.insert(y+n,x,inf);

     }

     memset(vis,,sizeof(vis));

     for (int i=;i<=p;i++)

     {

         scanf("%d",&x);vis[x]=;

         g.insert(s,x,inf);

     }

     for (int i=;i<=n;i++) if (!vis[i]) g.insert(i,i+n,);else g.insert(i,i+n,inf);

     printf("%d\n",g.Dinic(s,t));

     return ;

 }