from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N,M = list(map(int,input().split()))
edge = []
for _ in range(M):
    u,v = list(map(int,input().split()))
    u -= 1;v -= 1
    edge.append((u,v))

Q = int(input())
query = []
not_use = set(range(M))
for _ in range(Q):
    B = int(input()) - 1
    query.append(B)
    not_use.remove(B)

ans = N*(N-1)//2
uf = UnionFind(N)
for i in not_use:
    u,v = edge[i]
    if(not uf.same(u,v)):
        ans -= uf.size(u) * uf.size(v)
        uf.union(u,v)

ans_s = []
for i in query[::-1]:
    u,v = edge[i]
    ans_s.append(ans)
    if(not uf.same(u,v)):
        ans -= uf.size(u) * uf.size(v)
        uf.union(u,v)

for i in ans_s[::-1]:
    print(i)