#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

struct Node {
	int a, b, t;
	bool operator<(const Node& w) const {
		return t > w.t;
	}
}e[N];
int p[N], k, sz[N];
int find(int x) {
	if (p[x] != x) p[x] = find(p[x]);
	return p[x];
}

int main() {
	cin >> n >> m;
	iota(p + 1, p + n + 1, 1);
	fill(sz + 1, sz + n + 1, 1);
	for (int i = 1; i < m + 1; i++) scanf("%d%d", &e[i].a, &e[i].b), e[i].t = INF;
	cin >> k;
	for (int i = 1, x; i < k + 1; i++) scanf("%d", &x), e[x].t = i;
	sort(e + 1, e + m + 1);
	int l = 1;
	res = (ll)n * (n - 1) / 2;
	while (e[l].t == INF) {
		int a = find(e[l].a), b = find(e[l].b);
		if (a != b) {
			res -= (ll)sz[a] * sz[b];
			p[b] = a;
			sz[a] += sz[b];
		}
		l++;
	}
	vector<ll> ans = {res};
	while (l < m) {
		int a = find(e[l].a), b = find(e[l].b);
		if (a != b) {
			res -= (ll)sz[a] * sz[b];
			p[b] = a;
			sz[a] += sz[b];
		}
		l++;
		ans.push_back(res);
	}
	reverse(ans.begin(), ans.end());
	for (auto u : ans) printf("%lld\n", u);
	return 0;
}