// Original C++ solution (slower):
#include<bits/stdc++.h>

#define rep(i,n)for(int i=0;i<n;i++)

using namespace std;



void reader(int *x) {

	int k = getchar(); *x = k - '0';

	while (true) {

		k = getchar();

		if (k < '0' || k > '9') break;

		*x = ((*x) << 1) + ((*x) << 3) + k - '0';

	}

}

vector<int>E[100000];

int u[200000], v[200000], r[200000], ans[200000], d[100000], cnt = 1;

bool b[200000], ok[100000];



void bfs(int u) {

	queue<int>que;

	que.push(u);

	while (!que.empty()) {

		int p = que.front(); que.pop();

		for (int v : E[p]) {

			if (d[v] == d[p] + 1 && !ok[v]) {

				ok[v] = true; cnt++; que.push(v);

			}

		}

	}

}

int main() {

	int n, m, q; reader(&n); reader(&m); reader(&q);

	rep(i, m) {

		reader(&u[i]); reader(&v[i]);

		u[i]--; v[i]--;

		E[u[i]].push_back(v[i]); E[v[i]].push_back(u[i]);

	}

	queue<int>que;

	memset(d, -1, sizeof(d));

	d[0] = 0; que.push(0);

	while (!que.empty()) {

		int p = que.front(); que.pop();

		for (int i : E[p]) {

			if (d[i] == -1) {

				d[i] = d[p] + 1; que.push(i);

			}

		}

	}

	rep(i, m) {

		if (d[u[i]] > d[v[i]])swap(u[i], v[i]);

	}

	rep(i, n)E[i].clear();

	rep(i, q) {

		reader(&r[i]); r[i]--;

		b[r[i]] = true;

	}

	ok[0] = true;

	rep(i, m) {

		if (!b[i]) {

			if (d[v[i]] - d[u[i]] == 1) {

				E[u[i]].emplace_back(v[i]);

			}

		}

	}

	bfs(0);

	for (int i = q - 1; i >= 0; i--) {

		ans[i] = n - cnt;

		if (d[v[r[i]]] - d[u[r[i]]] == 1 && !ok[v[r[i]]]) {

			E[u[r[i]]].emplace_back(v[r[i]]);

			if (ok[u[r[i]]]) {

				cnt++; ok[v[r[i]]] = true;

				bfs(v[r[i]]);

			}

		}

	}

	rep(i, q)printf("%d\n", ans[i]);

}

// Optimized solution to the same problem (faster):
#include <stdio.h>

#include<vector>

#include<deque>

#define rep(i,n)for(int i=0;i<n;i++)

using namespace std;



void reader(int *x) {

	int k = getchar_unlocked(); *x = k - '0';

	while (true) {

		k = getchar_unlocked();

		if (k < '0') break;

		*x = ((*x) << 1) + ((*x) << 3) + k - '0';

	}

}

inline void writeln(int x) {

	int s = 0; char f[7];

	while (x) {

		f[s++] = x % 10;

		x /= 10;

	}

	if (!s) f[s++] = 0;

	while (s--) putchar_unlocked(f[s] + '0');

	putchar_unlocked('\n');

}



vector<int>E[100000];

int u[200000], v[200000], r[200000], ans[200000], d[100000]{ 1 }, cnt = 1;

char b[200000], ok[100000]{ 1 };

deque<int>que;



void bfs(int u, char t) {

	que.emplace_back(u);

	while (!que.empty()) {

		int p = que.front(); que.pop_front();

		for (int v : E[p]) {

			if (t) {

				if (d[v] > d[p] && !ok[v]) {

					ok[v] = 1; cnt++; que.emplace_back(v);

				}

			}

			else if (!d[v]) {

				d[v] = d[p] + 1; que.emplace_back(v);

			}

		}

	}

}

int main() {

	int n, m, q; reader(&n); reader(&m); reader(&q);

	rep(i, m) {

		reader(&u[i]); reader(&v[i]);

		u[i]--; v[i]--;

		E[u[i]].emplace_back(v[i]); E[v[i]].emplace_back(u[i]);

	}

	bfs(0, 0);

	rep(i, m) {

		if (d[u[i]] > d[v[i]])swap(u[i], v[i]);

	}

	rep(i, n)E[i].clear();

	rep(i, q) {

		reader(&r[i]); r[i]--;

		b[r[i]] = 1;

	}

	rep(i, m) {

		if (!b[i]) {

			if (d[v[i]] > d[u[i]]) {

				E[u[i]].emplace_back(v[i]);

			}

		}

	}

	bfs(0, 1);

	for (int i = q - 1; i >= 0; i--) {

		ans[i] = n - cnt;

		if (d[v[r[i]]] > d[u[r[i]]] && !ok[v[r[i]]]) {

			E[u[r[i]]].emplace_back(v[r[i]]);

			if (ok[u[r[i]]]) {

				cnt++; ok[v[r[i]]] = 1;

				bfs(v[r[i]], 1);

			}

		}

	}

	rep(i, q)writeln(ans[i]);

}

// Fastest known solution for this problem: