# 1-indexed

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

    def root(self, x):
        stack = []
        tbl = self.table
        while tbl[x] >= 0:
            stack.append(x)
            x = tbl[x]
        for y in stack:
            tbl[y] = x
        return x

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

    def unite(self, x, y):
        r1 = self.root(x)
        r2 = self.root(y)
        if r1 == r2:
            return False
        d1 = self.table[r1]
        d2 = self.table[r2]
        if d1 <= d2:
            self.table[r2] = r1
            self.table[r1] += d2
        else:
            self.table[r1] = r2
            self.table[r2] += d1
        return True

    def get_size(self, x):
        return -self.table[self.root(x)]
    


n,m = map(int, input().split())
uv = []
for i in range(m):
    u,v = map(int, input().split())
    u -= 1
    v -= 1
    uv.append((u,v))

q = int(input())
blist = [int(input()) - 1 for i in range(q)]

ans = [n*(n-1)//2 for i in range(q+1)]

uf = UnionFind(n)

can = [1 for i in range(m)]

for b in blist:
    can[b] = 0

cnt = 0

for i in range(m):
    if can[i] == 0:
        continue
    u,v = uv[i]
    if uf.find(u,v):
        continue

    usize = uf.get_size(u)
    vsize = uf.get_size(v)
    cnt += usize * vsize

    uf.unite(u,v)

ans[q] -= cnt

for qi in range(q)[::-1]:
    b = blist[qi]
    u,v = uv[b]
    if uf.find(u,v):
        ans[qi] -= cnt
        continue

    usize = uf.get_size(u)
    vsize = uf.get_size(v)
    cnt += usize * vsize

    uf.unite(u,v)

    ans[qi] -= cnt

for i in range(1, q+1):
    print(ans[i])