#include <bits/stdc++.h>   using namespace std;   const int MAX = 1e5 + 3;   struct node {     int nonzero, val;     void merge(node &n1, node &n2, int range) {       if (val)         nonzero = range;       else         nonzero = n1.nonzero + n2.nonzero;     }     void update(int x) { val += x; }   } tree[7 * MAX];   void update(int root, int l, int r, int u, int v, int val) {     if (u <= l and v >= r) {       tree[root].update(val);       tree[root].merge(tree[2 * root], tree[2 * root + 1], r - l + 1);       return;     }     int mid = (l + r) / 2;     if (u <= mid) update(2 * root, l, mid, u, v, val);     if (v > mid) update(2 * root + 1, mid + 1, r, u, v, val);     tree[root].merge(tree[2 * root], tree[2 * root + 1], r - l + 1);   }   vector<int> G[MAX], intervals[MAX];   int st[MAX], en[MAX], Time = 0, ans[MAX], n, m;   void dfs(int x, int par) {     st[x] = ++Time;     for (int i = 0; i < G[x].size(); i++)       if (G[x][i] != par) dfs(G[x][i], x);     en[x] = Time;   }   void dfs2(int x, int par) {     if (intervals[x].size()) intervals[x].push_back(x);     for (int i = 0; i < intervals[x].size(); i++)       update(1, 1, n, st[intervals[x][i]], en[intervals[x][i]], 1);     ans[x] = max(0, tree[1].nonzero - 1);     for (int i = 0; i < G[x].size(); i++)       if (G[x][i] != par) dfs2(G[x][i], x);     for (int i = 0; i < intervals[x].size(); i++)       update(1, 1, n, st[intervals[x][i]], en[intervals[x][i]], -1);   }   int main() {     scanf( %d , &n);     ;     scanf( %d , &m);     ;     memset(tree, 0, sizeof tree);     for (int i = 0; i < n - 1; i++) {       int a, b;       scanf( %d , &a);       ;       scanf( %d , &b);       ;       G[a].push_back(b);       G[b].push_back(a);     }     dfs(1, -1);     while (m--) {       int a, b;       scanf( %d , &a);       ;       scanf( %d , &b);       ;       intervals[a].push_back(b);       intervals[b].push_back(a);     }     dfs2(1, -1);     for (int i = 1; i < n + 1; i++) printf( %d  , ans[i]);     cout << endl;     return 0;   }   