#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector to(n, vector<P>());
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back({ v,i + 1 });
		to[v].push_back({ u,i + 1 });
	}
	vector dp(n, vector<int>());
	auto f = [&](int st)->void {
		vector<int>tmp(n, INF);
		queue<int>que;
		que.push(st);
		while (!que.empty()) {
			auto v = que.front();
			que.pop();
			for (auto &[nv, d] : to[v]) {
				if (INF != tmp[nv])continue;
				tmp[nv] = min(tmp[v], d);
				que.push(nv);
			}
		}
		dp[st] = tmp;
	};
	rep(i, n)f(i);
	vector<int>ans(n - 1);
	ans[0] = m;
	rep(i, m) {
		int s, t; cin >> s >> t;
		s--, t--;
		ans[dp[s][t] - 1]--;
	}
	rep(i, n - 1)ans[i + 1] += ans[i];
	rep(i, n - 1)cout << ans[i] << endl;
	return 0;
}