R=range
J=lambda:map(int,input().split())
N,M=J()
e=[[]for i in R(N)]
for m in R(N-1):i,j=J();e[i-1]+=[(j-1,m)];e[j-1]+=[(i-1,m)]
p=[[N]*N for i in R(N)]
for i in R(N):
	d,f=[i],[1]*N;f[i]=0
	while d:
		j=d.pop()
		for k,m in e[j]:
			if f[k]:f[k],p[i][k]=0,min(p[i][j],m);d+=[k]
a=[M]+[0]*N
for m in R(M):s,t=J();a[p[s-1][t-1]]-=1
for k in R(N-1):a[k+1]+=a[k];print(a[k])