class UnionFind:
    def __init__(self, n: int):
        self.data = [-1] * (n+1)
        self.nexts = [i for i in range(n+1)]

    def root(self, a: int) -> int:
        if self.data[a] < 0: return a
        self.data[a] = self.root(self.data[a])
        return self.data[a]

    def unite(self, a: int, b: int) -> bool:
        pa = self.root(a)
        pb = self.root(b)
        if pa == pb: return False
        if self.data[pa] > self.data[pb]:
            pa, pb = pb, pa
        self.data[pa] += self.data[pb] # pa を pb をつなげる
        self.data[pb] = pa
        self.nexts[pa], self.nexts[pb] = self.nexts[pb], self.nexts[pa]
        return True

    def is_same(self, a: int, b: int) -> bool:
        return self.root(a) == self.root(b)

    def size(self, a: int) -> int:
        """a が属する集合のサイズ"""
        return -self.data[self.root(a)]

    def group(self, a: int):
        """a が属する集合"""
        yield a
        x = a
        while self.nexts[x] != a:
            x = self.nexts[x]
            yield x


from math import comb

N, M = map(int, input().split())
edges = []
for _ in range(M):
    U, V = map(lambda x: int(x)-1, input().split())
    edges.append((U, V))

Q = int(input())
B = []
for _ in range(Q):
    B.append(int(input()) - 1)

uf = UnionFind(N)
s = set(B)
tot = comb(N, 2)  # 行き来できないペア数
for ei in set(range(M)) - set(B):
    u, v = edges[ei]
    if not uf.is_same(u, v):
        a = uf.size(u)
        b = uf.size(v)
        tot -= a * b
        uf.unite(u, v)

res = []
for bi in reversed(B):
    res.append(tot)
    u, v = edges[bi]
    if not uf.is_same(u, v):
        a = uf.size(u)
        b = uf.size(v)
        tot -= a * b
        uf.unite(u, v)

print(*reversed(res), sep='\n')