#include<bits/stdc++.h>
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define mid ((l+r)>>1)
using namespace std;
typedef long long ll;
const int MAXN = 5e5+10;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
int n,m;

struct Seg{
    int va[MAXN<<2],ca[MAXN<<2],ta[MAXN<<2],tb[MAXN<<2]; 
    ll vb[MAXN<<2];
    void pu(int x){
        va[x] = min(va[lc(x)],va[rc(x)]);
        vb[x] = (va[lc(x)] == va[x]) * vb[lc(x)] + (va[rc(x)] == va[x]) * vb[rc(x)];
        ca[x] = (va[lc(x)] == va[x]) * ca[lc(x)] + (va[rc(x)] == va[x]) * ca[rc(x)];
    }
    void ma(int x,int v){
        va[x] += v; ta[x] += v;}
    void mb(int x,int v){
        vb[x] += 1ll*v*ca[x]; tb[x] += v;
    }
    void pd(int x){
        if(ta[x])ma(lc(x),ta[x]),ma(rc(x),ta[x]);
        if(tb[x])mb(lc(x),tb[x]),mb(rc(x),tb[x]);
        ta[x] = tb[x] = 0;
    }
    void build(int x,int l,int r){
        ca[x] = r-l+1; if(l==r)return;
        build(lc(x),l,mid); build(rc(x),mid+1,r);
    }
    void mdf(int x,int l,int r,int ql,int qr,int p,int w){
        if(ql>qr)return; if(ql<=l && qr>=r)return (!p) ? ma(x,w) : mb(x,w);
        pd(x);
        if(ql<=mid)mdf(lc(x),l,mid,ql,qr,p,w);
        if(qr>mid)mdf(rc(x),mid+1,r,ql,qr,p,w);
        pu(x);
    }
}seg;

int u[MAXN],v[MAXN],p[MAXN];

void link(int x,int y,int w){
    int L = min(p[x],p[y]),R = max(p[x],p[y]);
    seg.mdf(1,1,n-1,1,L-1,0,-w);
    seg.mdf(1,1,n-1,R,n-1,1,-w);
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n>>m;
    for(int i=1;i<n;i++)cin>>u[i]>>v[i];
    p[1] = n;
    for(int i=1,x;i<n;i++)cin>>x,p[x] = i;

    seg.build(1,1,n-1);
    for(int i=1;i<=n;i++){
        int pos = p[i];
        seg.mdf(1,1,n-1,1,pos-1,0,1);
        seg.mdf(1,1,n-1,pos,n-1,1,1);
    }
    for(int i=1;i<n;i++)link(u[i],v[i],1);

    cout<<seg.vb[1]<<"\n";
    while(m--){
        int a,b,c,d; cin>>a>>b>>c>>d;
        link(a,b,-1); link(c,d,1);
        cout<<seg.vb[1]<<"\n";
    }

    return 0;
}