N,M=map(int,input().split())
from collections import deque
d=deque()

dp=[[-1]*N for i in range(N)]
D={}
C=[[] for i in range(N)]

A=[]
for i in range(N-1):
  u,v=map(int,input().split())
  u-=1;v-=1
  C[u].append((v,i))
  C[v].append((u,i))
  
for i in range(N):
  V=[-1]*N 
  d=deque()
  d.append((i,10**10))
  V[i]=1 
  while d:
    now,c=d.popleft()
    for nex,p in C[now]:
      cc=min(c,p)
      dp[i][nex]=cc 
      if V[nex]==-1:
        V[nex]=1
        d.append((nex,cc)) 

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

ans=M 
for i in range(N-1):
  ans+=B[i]
  print(ans)