n, m = map(int, input().split())
node = [[] for _ in range(n)]
for _ in range(n-1):
    u, v = [int(x)-1 for x in input().split()]
    node[u].append((v, _))
    node[v].append((u, _))
ST = [list(map(lambda x: int(x)-1, input().split())) for _ in range(m)]


Ans = [0] * n
dp = [[n+1 for _ in range(n)] for _ in range(n)]
for s in range(n):
    S = [s]
    dp[s][s] = n
    while S:
        now = S.pop()
        for nxt, idx in node[now]:
            if dp[s][nxt] == n+1:
                dp[s][nxt] = min(dp[s][now], idx)
                S.append(nxt)

for s, t in ST:
    Ans[dp[s][t]] += 1

for i in range(n-2, -1, -1):
    Ans[i] += Ans[i+1]

for ans in Ans[1:]:
    print(ans)