#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
vector<pair<int,int>> E[3030];
int dp[3030][3030];
int ret[3030];
void dfs(int cur,int pre,int id,int mi) {
	dp[id][cur]=mi;
	FORR2(e,m,E[cur]) if(e!=pre) dfs(e,cur,id,min(mi,m));
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,N-1) {
		cin>>x>>y;
		E[x-1].push_back({y-1,i+1});
		E[y-1].push_back({x-1,i+1});
	}
	FOR(i,N) dfs(i,i,i,1<<20);
	
	ret[0]=M;
	while(M--) {
		cin>>x>>y;
		ret[dp[x-1][y-1]]--;
	}
	FOR(i,N-1) {
		ret[i+1]+=ret[i];
		cout<<ret[i+1]<<endl;
	}
		
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}