#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

const int MAXN = 1005;
vector<int> adj[MAXN];   // 邻接表存储图
bool visited[MAXN];      // 标记节点是否访问过

// 深度优先搜索，跳过被占领的城市 forbidden
void dfs(int u, int forbidden) {
    visited[u] = true;
    for (int v : adj[u]) {
        if (v != forbidden && !visited[v]) {
            dfs(v, forbidden);
        }
    }
}

int main() {
    int N, M, K;
    cin >> N >> M >> K;

    // 读入高速公路
    for (int i = 0; i < M; ++i) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    // 处理每个查询
    for (int i = 0; i < K; ++i) {
        int city;
        cin >> city;
        memset(visited, false, sizeof(visited));   // 重置访问标记

        int components = 0;   // 连通分量个数
        for (int j = 1; j <= N; ++j) {
            if (j != city && !visited[j]) {
      ...