#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = (ll)s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define TT template <typename T>
template <class T1, class T2>
bool chmin(T1& x, T2 y) { return x > y ? (x = y, true) : false; }
template <class T1, class T2>
bool chmax(T1& x, T2 y) { return x < y ? (x = y, true) : false; }

struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
        srand(time(NULL));
    }
} io_setup;

void solve() {
    int N, M;
    cin >> N >> M;
    vector<int> U(N - 1), V(N - 1);
    rep(i, 0, N - 1) {
        cin >> U[i] >> V[i];
        U[i]--;
        V[i]--;
    }
    vector flag(N, vector<bool>(N));
    rep(i, 0, M) {
        int s, t;
        cin >> s >> t;
        s--;
        t--;
        flag[s][t] = true;
        flag[t][s] = true;
    }
    vector<vector<int>> G(N);
    vector<int> id(N);
    rep(i, 0, N) {
        G[i].push_back(i);
        id[i] = i;
    }
    vector<int> ans(N - 1);
    rrep(k, 0, N - 1) {
        int u = id[U[k]], v = id[V[k]];
        assert(u != v);
        if (G[u].size() > G[v].size()) {
            swap(u, v);
        }
        for (auto x : G[u]) for (auto y : G[v]) {
            if (flag[x][y]) {
                ans[0]++;
                ans[k]--;
            }
        }
        for (auto x : G[v]) {
            G[u].push_back(x);
            id[x] = u;
        }
        G[v].clear();
    }
    rep(k, 0, N - 2) ans[k + 1] += ans[k];
    rep(k, 0, N - 1) cout << ans[k] << "\n";
}

int main() {
    solve();
}