// Slower C++ solution:
#include<iostream>

#include<queue>

using namespace std;



//-----------------------------------LIBRARY OF INPUT-----------------------------------

void reader(int *x) {

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

	while (true) {

		k = getchar_unlocked();

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

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

	}

}



int n, m, q, dist[110003], mark[110003], u[210003], v[210003];

vector<pair<int, int>>x[110003], y[110003], z[110003]; bool used[210003];

inline bool isgood(int f) {

	for (int i = 0; i < z[f].size(); i++) {

		if (mark[z[f][i].first] == 0 && used[z[f][i].second] == false)return true;

	}

	return false;

}

int main() {

	reader(&n); reader(&m); reader(&q); queue<int>Q;

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

		int a = 0, b = 0;

		reader(&a);

		reader(&b);

		u[i + 1] = a; v[i + 1] = b;

		x[a].push_back(make_pair(b, i + 1)); x[b].push_back(make_pair(a, i + 1));

	}

	Q.push(1); for (int i = 1; i <= n; i++)dist[i] = 999999; dist[1] = 0;

	while (!Q.empty()) {

		int a1 = Q.front(); Q.pop();

		for (int i = 0; i < x[a1].size(); i++) {

			if (dist[x[a1][i].first] > dist[a1] + 1) { dist[x[a1][i].first] = dist[a1] + 1; Q.push(x[a1][i].first); }

		}

	}

	for (int i = 1; i <= n; i++) {

		for (int j = 0; j < x[i].size(); j++) {

			if (dist[i] < dist[x[i][j].first]) { y[i].push_back(x[i][j]); }

			if (dist[i] > dist[x[i][j].first]) { z[i].push_back(x[i][j]); }

		}

	}

	int cnt = 0;

	for (int i = 0; i < q; i++) {

		int a = 0;

		reader(&a);

		used[a] = true;

		int E1 = u[a], E2 = v[a];

		if (dist[E1] == dist[E2]) { cnt += 0; }

		else {

			int a1 = 0; if (dist[E1] < dist[E2])a1 = E2; else a1 = E1;

			if (mark[a1] == 0 && isgood(a1) == false) {

				queue<int>Q; Q.push(a1); cnt++; mark[a1] = 1;

				while (!Q.empty()) {

					int a2 = Q.front(); Q.pop();

					for (int j = 0; j < y[a2].size(); j++) {

						if (mark[y[a2][j].first] == 0 && isgood(y[a2][j].first) == false) {

							mark[y[a2][j].first] = 1; Q.push(y[a2][j].first); cnt++;

						}

					}

				}

			}

		}

		printf("%d\n", cnt);

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.451151591203343x):
#include<bits/stdc++.h>

using namespace std;

int n, m, q, a[210000], b[210000], c, dist[110000], T[110000], cnt, U[110000];

vector<pair<int, int> >x[110000], y[110000]; bool used[210000];

int main() {

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

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

		scanf("%d%d", &a[i], &b[i]);

		x[a[i]].push_back(make_pair(b[i], i));

		x[b[i]].push_back(make_pair(a[i], i));

	}

	fill(dist, dist + n + 1, 999999); dist[1] = 0;

	queue<int> Q; Q.push(1);

	while (!Q.empty()) {

		int a1 = Q.front(); Q.pop();

		for (pair<int, int> i : x[a1]) {

			if (dist[i.first] > dist[a1] + 1) {

				dist[i.first] = dist[a1] + 1;

				Q.push(i.first);

			}

		}

	}

	for (int i = 1; i <= n; i++) {

		for (pair<int, int> j : x[i]) {

			if (dist[i] < dist[j.first]) {

				y[i].push_back(j);

				T[j.first]++;

			}

		}

	}

	for (int i = 0; i < q; i++) {

		scanf("%d", &c); c--;

		queue<pair<int, int> > Q1;

		int ss = -1;

		if (dist[a[c]] < dist[b[c]])ss = b[c];

		if (dist[a[c]] > dist[b[c]])ss = a[c];

		if (ss >= 1 && U[ss] == 0 && used[c] == false) {

			Q1.push(make_pair(ss, c));

			while (!Q1.empty()) {

				int a1 = Q1.front().first, a2 = Q1.front().second; Q1.pop();

				if (U[a1] == 1 || used[a2] == true) continue; T[a1]--; used[a2] = true;

				if (T[a1] != 0) continue; cnt++; U[a1] = 1;

				for (pair<int, int> j : y[a1]) {

					if (U[j.first] == 0) Q1.push(j);

				}

			}

		}

		cout << cnt << endl;

	}

	return 0;

}