#include<iostream>
using namespace std;

const int N = 1010, M = 500010;
int p[N];
struct edge{
    int a, b;
}e[M];
int find(int x){
    if(p[x]!=x) p[x]=find(p[x]);
    return p[x];    
}

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 0; i < m; i++) scanf("%d %d", &e[i].a, &e[i].b);

    for(int i = 0; i < k; i++){
        int cnt = n-1; // 去掉x一共有n-1个连通块。
        int x;
        scanf("%d", &x);
        for(int j = 1; j<=n; j++) p[j] = j;
        for(int j = 0; j< m; j++){
            int a = e[j].a;
            int b = e[j].b;
            if(a!=x&&b!=x){
                int pa = find(a), pb = find(b);
                if(pa!=pb){
                    p[pa] = pb;
                    cnt--;
                }
            }
        }
        printf("%d\n", cnt-1);
    }
}