// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;

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

#define sz(c) ((int)c.size())

#define ten(n) ((int)1e##n)

using ll = long long;



//template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }

//template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }

#define mygc(c) (c)=getchar_unlocked()

#define mypc(c) putchar_unlocked(c)

void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }

void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }

int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }

int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }

template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }

template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }

template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }

void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }

void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }

void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }

void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }

template<class T> void writerLn(T x) { writer(x, '\n'); }

template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }

template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }

template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }



template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

ll mod_pow(ll a, ll n, ll mod) {

	ll ret = 1;

	ll p = a % mod;

	while (n) {

		if (n & 1) ret = ret * p % mod;

		p = p * p % mod;

		n >>= 1;

	}

	return ret;

}

template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }

template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }



using Pii = pair<int, int>;

using Pll = pair<ll, ll>;

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

vector<int>E[100000];

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

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

deque<int>que;



void bfs(int u, int 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]);

	}

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

	d[0] = 0; 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)writerLn(ans[i]);

}

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

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

using namespace std;

typedef pair<int, int>P;



vector<P>E[100000];

int d[100000], b[100000], cnt[200001], u[200000], v[200000], r[200000], que[100000];

int main() {

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

	rep(i, m) {

		scanf("%d%d", &u[i], &v[i]); u[i]--; v[i]--; r[i] = q;

	}

	rep(i, q) {

		int a; scanf("%d", &a); r[a - 1] = i;

	}

	rep(i, m) {

		E[u[i]].push_back(P(v[i], r[i])); E[v[i]].push_back(P(u[i], r[i]));

	}

	d[0] = 1; b[0] = q;

	int s = 0, g = 1;

	while (s != g) {

		int p = que[s++];

		rep(i, E[p].size()) {

			P v = E[p][i];

			if (d[v.first] == 0) {

				d[v.first] = d[p] + 1; que[g++] = v.first;

			}

			if (d[v.first] == d[p] + 1)

				b[v.first] = max(b[v.first], min(b[p], v.second));

		}

	}

	rep(i, n)cnt[b[i]]++;

	int ans = 0;

	rep(i, q) {

		ans += cnt[i];

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

	}

}