#include <bits/stdc++.h>
using namespace std;

static auto __fast_io = []()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    return 0;
}();

// #define DEBUGx
#ifdef DEBUGx
#define TRC_PG(fmt, args...) fprintf(stderr, "\033[1;32m  TRC_PG(%s:%d):\t\033[0m" fmt, __func__, __LINE__, ##args)
#define TRC_PR(fmt, args...) fprintf(stderr, "\033[1;31m  TRC_PR(%s:%d):\t\033[0m" fmt, __func__, __LINE__, ##args)
#define debug fprintf(stderr, "Passing [%s] in LINE %d\t\n", __func__, __LINE__)
#endif
#ifndef DEBUGx
#define TRC_PG(...)
#define TRC_PR(...)
#define debug
#endif

const int MAX = 2e5 + 10;

vector<int> child[MAX];
int dep[MAX];
int fa[MAX][30];
int cnt[MAX];
int p[MAX]; // 维护树上差分
int n, m;

void dfs(int u, int f, int deep)
{
    fa[u][0] = f;
    dep[u] = deep;
    for (auto v : child[u])
    {
        if (v == f)
            continue;
        dfs(v, u, deep + 1);
    }
}

int lca(int x, int y)
{
    if (dep[x] < dep[y])
        swap(x, y);
    for (int i = 29; i >= 0; i--)
    {
        if (dep[x] - (1 << i) >= dep[y])
            x = fa[x][i];
    }
    if (x == y)
        return x;
    for (int i = 29; i >= 0; i--)
    {
        if (fa[x][i] != fa[y][i])
        {
            x = fa[x][i];
            y = fa[y][i];
        }
    }
    return fa[x][0];
}

int dfs2(int u, bool flag)
{
    for (auto v : child[u])
    {
        if (v == fa[u][0])
            continue;
        p[u] += dfs2(v, false);
    }
    TRC_PR("p[%d] = %d %d\n", u, p[u], fa[u][0]);
    return p[u];
}

void input()
{
    cin >> n >> m;
    int u, v;
    for (int i = 1; i < n; i++)
    {
        cin >> u >> v;
        child[u].push_back(v);
        child[v].push_back(u);
    }
    dfs(1, 0, 0);
}
void init()
{
    for (int j = 1; j < 30; j++)
    {
        for (int i = 1; i <= n; i++)
        {
            fa[i][j] = fa[fa[i][j - 1]][j - 1];
        }
    }
}
void work()
{
    int x, y;
    for (int i = 1; i <= m; i++)
    {
        cin >> x >> y;
        // lca(x, y)
        int l = lca(x, y);
        p[x]++;
        p[y]++;
        p[l] -= 2;
        TRC_PG("l = %d\n", l);
    }
    debug;
    dfs2(1, true);
    for (int i = 2; i <= n; i++)
    {
        TRC_PG("p[%d]=%d\n", i, p[i]);
        cnt[p[i]]++;
    }
}
void output()
{
    for (int i = 0; i <= m; i++)
    {
        cout << cnt[i] << " ";
    }
    cout << "\n";
}

int main()
{
    input();
    init();
    work();
    output();
    return 0;
}