#include <bits/stdc++.h>

#include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
#include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>
#include <atcoder/lazysegtree.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
// using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll n, m;
	cin >> n >> m;
	vector<vector<pair<ll, ll>>> g(n);
	rep(i, n - 1)
	{
		ll u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u].push_back({v, i});
		g[v].push_back({u, i});
	}
	vector<vector<ll>> s2t_min_vals(n, vector<ll>(n, ll_max));
	auto dfs = [&](auto &f, ll s, ll v, ll p, ll mn) -> void
	{
		s2t_min_vals[s][v] = mn;
		for (auto [nex, k] : g[v])
		{
			if (nex == p)
				continue;
			ll nmn = min(mn, k);
			f(f, s, nex, v, nmn);
		}
	};
	rep(i, n)
	{
		dfs(dfs, i, i, -1, ll_max);
	}
	fenwick_tree<ll> ft(n + 1);
	ft.add(0, m);
	rep(i, m)
	{
		ll s, t;
		cin >> s >> t;
		s--;
		t--;
		ll mn = s2t_min_vals[s][t];
		ft.add(mn, -1);
	}
	rep(i, n - 1)
	{
		cout << ft.sum(0, i + 1) << endl;
	}
	return 0;
}