import sys
sys.setrecursionlimit(200000)

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):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N, M = map(int, input().split())
U = [0] * M
for i in range(M):
    u, v = map(int, input().split())
    U[i] = [u-1, v-1]

Q = int(input())
q = [0] * Q
for i in range(Q):
    q[i] = int(input()) - 1

u = UnionFind(N)
a = set(range(M)) - set(q)

for x in a:
    u.union(U[x][0], U[x][1])

ans = []
t = N * (N-1) // 2
for r in u.roots():
    s = u.size(r)
    t -= s * (s-1) // 2



for i in range(Q):
    ans.append(t)
    b = q[i]
    x, y = U[b]

    if u.same(x, y):
        continue

    sx = u.size(x)
    sy = u.size(y)

    t -= sx * sy
    u.union(x, y)

for x in ans[::-1]:
    print(x)