1 #include<iostream>
  2 #include<cstring>
  3 #include<cstdio>
  4 using namespace std;
  5 inline int read(){
  6     int sum(0);
  7     char ch(getchar());
  8     while(ch<‘0‘||ch>‘9‘)
  9         ch=getchar();
 10     while(ch>=‘0‘&&ch<=‘9‘){
 11         sum=sum*10+ch-‘0‘;
 12         ch=getchar();
 13     }
 14     return sum;
 15 }
 16 int n,m;
 17 struct edge{
 18     int s,e,n;
 19 }a[200001];
 20 int pre[100001],tot;
 21 inline void insert(int s,int e){
 22     a[++tot].s=s;
 23     a[tot].e=e;
 24     a[tot].n=pre[s];
 25     pre[s]=tot;
 26 }
 27 int fa[100001],dep[100001],size[100001],son[100001];
 28 inline void dfs1(int u){
 29     son[u]=0;
 30     for(int i=pre[u];i!=-1;i=a[i].n){
 31         int e(a[i].e);
 32         if(e!=fa[u]){
 33             fa[e]=u;
 34             dep[e]=dep[u]+1;
 35             dfs1(e);
 36             size[u]+=size[e];
 37             if(size[e]>size[son[u]])
 38                 son[u]=0;
 39         }
 40     }
 41 }
 42 int cnt;
 43 int r[100001];
 44 int top[100001],id[100001],pos[100001];
 45 inline void dfs2(int u,int rt){
 46     top[u]=rt;
 47     id[u]=++cnt;
 48     pos[cnt]=u;
 49     if(son[u])
 50         dfs2(son[u],rt);
 51     for(int i=pre[u];i!=-1;i=a[i].n){
 52         int e(a[i].e);
 53         if(e!=fa[u]&&e!=son[u])
 54             dfs2(e,e);
 55     }
 56     r[u]=cnt;
 57 }
 58 int sum[100001];
 59 inline int lowbit(int x){
 60     return x&-x;
 61 }
 62 inline void update(int pos,int c){
 63     while(pos<=n){
 64         sum[pos]+=c;
 65         pos+=lowbit(pos);
 66     }
 67 }
 68 inline int su(int pos){
 69     int ret(0);
 70     while(pos){
 71         ret+=sum[pos];
 72         pos-=lowbit(pos);
 73     }
 74     return ret;
 75 }
 76 inline int query(int l,int r){
 77     return su(r)-su(l-1);
 78 }
 79 inline void swp(int &a,int &b){
 80     a^=b;
 81     b^=a;
 82     a^=b;
 83 }
 84 inline int LCA(int x,int y){
 85     while(top[x]^top[y]){
 86         if(dep[top[x]]<dep[top[y]])
 87             swp(x,y);
 88         x=fa[top[x]];
 89     }
 90     return dep[x]<dep[y]?x:y;
 91 }
 92 inline void change(int x,int y){
 93     int lca(LCA(x,y));
 94     update(id[lca],-2);
 95     update(id[x],1);
 96     update(id[y],1);
 97 }
 98 inline int Q(int x){
 99     return query(id[x],r[x]);
100 }
101 typedef long long L;
102 L ans(0);
103 inline L get(int x){
104     if(x==0)
105         return m;
106     if(x==1)
107         return 1;
108     else
109         return 0;
110 }
111 inline int gg(){
112     freopen("yam.in","r",stdin);
113     freopen("yam.out","w",stdout);
114     memset(pre,-1,sizeof(pre));
115     n=read(),m=read();
116     for(int i=1;i<n;i++){
117         int x(read()),y(read());
118         insert(x,y);
119         insert(y,x);
120     }
121     dfs1(1);
122     dfs2(1,1);
123     for(int i=1;i<=m;i++){
124         int x(read()),y(read());
125         change(x,y);
126     }
127     for(int i=2;i<=n;i++){
128         int ret(Q(i));
129         ans+=get(ret);
130     }
131     printf("%d",ans);
132 }
133 int K(gg());
134 int main(){;}