#include <bits/stdc++.h>
using namespace std;

#define int ll
#define fast_io cin.tie(0)->sync_with_stdio(0);
#define endl '\n'
typedef long long ll;

int32_t main() {
	fast_io;

	int n, m;
	cin >> n >> m;

	vector<pair<int, int>> edges(m);
	for (auto &[a, b] : edges) cin >> a >> b, --a, --b;

	int q; cin >> q;
	vector<int> queries(q);

	for (auto &i : queries) cin >> i, --i;

	vector<int> when(m, -1);
	for (int i = 0; i < q; i++) when[queries[i]] = i;

	vector<int> id(n), sz(n, 1);
	iota(id.begin(), id.end(), 0);
	function<int(int)> vai = [&] (int i) {
		if (i == id[i]) return i;
		return id[i] = vai(id[i]);
	};
	auto unite = [&] (int a, int b) -> int {
		a = vai(a), b = vai(b);
		if (a == b) return 0;
		int qt = sz[a] * sz[b];	
		sz[a] += sz[b];
		id[b] = a;
		return qt;
	};

	int tot = n * (n - 1) / 2;
	for (int i = 0; i < m; i++) if (when[i] == -1) {
		auto [a, b] = edges[i];
		int qt = unite(a, b);
		tot -= qt;
	}

	vector<int> ans(q);
	for (int i = q - 1; i >= 0; --i) {
		auto [a, b] = edges[queries[i]];
		ans[i] = unite(a, b);
		tot -= ans[i];
	}
	
	for (int i = 0; i < q; i++) {
		if (i) ans[i] += ans[i - 1];
		cout << ans[i] + tot << endl;
	}
}