// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
struct Info{int minv;uint cnt;ullt sum;};
Info operator+(Info a,Info b){return a.minv==b.minv?Info{a.minv,a.cnt+b.cnt,a.sum+b.sum}:(a.minv<b.minv?a:b);}
Info tag(Info a,int b,ullt c){return{a.minv+b,a.cnt,a.sum+a.cnt*c};}
Info Val[1u<<21|1];
int Tag1[1u<<21|1];
ullt Tag2[1u<<21|1];
uint n;
voi build(uint l,uint r,uint x){
    if(l+1<r)
        build(l,(l+r)>>1,x<<1),build((l+r)>>1,r,x<<1|1);
    Val[x]={(int)(n-r),1,r};
}
voi addtag1(uint r,int w,uint n,uint x){
    if(!r)return;
    if(r==n){Val[x]=tag(Val[x],w,0),Tag1[x]+=w;return;}
    if(r<=(n>>1))addtag1(r,w,n>>1,x<<1);
    else addtag1(n>>1,w,n>>1,x<<1),addtag1(r-(n>>1),w,n-(n>>1),x<<1|1);
    Val[x]=tag(Val[x<<1]+Val[x<<1|1],Tag1[x],Tag2[x]);
}
voi addtag2(uint l,ullt w,uint n,uint x){
    if(l==n)return;
    if(!l){Val[x]=tag(Val[x],0,w),Tag2[x]+=w;return;}
    if(l>=(n>>1))addtag2(l-(n>>1),w,n-(n>>1),x<<1|1);
    else addtag2(l,w,n>>1,x<<1),addtag2(0,w,n-(n>>1),x<<1|1);
    Val[x]=tag(Val[x<<1]+Val[x<<1|1],Tag1[x],Tag2[x]);
}
uint T[500005];
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    // freopen("QAQ.out","w",stdout);
#endif
    uint q;scanf("%u%u",&n,&q);build(0,n-1,1);
    {
        std::vector<std::pair<uint,uint> >E(n-1);
        for(auto&e:E)scanf("%u%u",&e.first,&e.second);
        T[0]=n-1;for(uint i=0,p;i<n-1;i++)scanf("%u",&p),T[p-1]=i;
        for(auto e:E){
            uint u=T[e.first-1],v=T[e.second-1];if(u>v)std::swap(u,v);
            addtag1(u,-1,n-1,1),addtag2(v,-1,n-1,1);
        }
    }
    auto get=[&]{return Val[1].minv==1?Val[1].sum:0llu;};
    printf("%llu\n",get());
    while(q--){
        uint u,v;
        scanf("%u%u",&u,&v),u=T[u-1],v=T[v-1];if(u>v)std::swap(u,v);
        addtag1(u,1,n-1,1),addtag2(v,1,n-1,1);
        scanf("%u%u",&u,&v),u=T[u-1],v=T[v-1];if(u>v)std::swap(u,v);
        addtag1(u,-1,n-1,1),addtag2(v,-1,n-1,1);
        printf("%llu\n",get());
    }
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。