#include<iostream>
#include<cstdio>
#include<vector>
#define N 500000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,m,a[N+1],p[N+1],X[N+1],Y[N+1];
bool used[N+1];
vector<int>E[N+1];
struct reads
{
    int num,cnt;
    long long data;
};
reads operator + (reads a,reads b)
{
    if (a.num>b.num) swap(a,b);
    if (a.num==b.num) return (reads){a.num,a.cnt+b.cnt,a.data+b.data};
    else return a;
}
struct seg
{
    struct node
    {
	int l,r,lazy,lazy2;
	reads minn;
    };
    node tree[(N<<2)+1];
    void push_up(int k)
    {
	tree[k].minn=tree[k<<1].minn+tree[k<<1|1].minn;
	return;
    }
    void spread(int k)
    {
	if (tree[k].lazy)
	{
	    tree[k<<1].minn.num+=tree[k].lazy,tree[k<<1].lazy+=tree[k].lazy;
	    tree[k<<1|1].minn.num+=tree[k].lazy,tree[k<<1|1].lazy+=tree[k].lazy;
	    tree[k].lazy=0;
	}
	if (tree[k].lazy2)
	{
	    tree[k<<1].minn.data+=1ll*tree[k<<1].minn.cnt*tree[k].lazy2,tree[k<<1].lazy2+=tree[k].lazy2;
	    tree[k<<1|1].minn.data+=1ll*tree[k<<1|1].minn.cnt*tree[k].lazy2,tree[k<<1|1].lazy2+=tree[k].lazy2;
	    tree[k].lazy2=0;
	}
	return; 
    }
    void build(int k,int l,int r)
    {
	tree[k].l=l,tree[k].r=r;
	if (l==r)
	{
	    tree[k].minn=(reads){n-l,1,0};
	    return;
	}
	int mid=(l+r)>>1;
	build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
	return;    
    }
    void add(int k,int l,int r,int d)
    {
	if (l>r) return;
	if (tree[k].l==l&&tree[k].r==r)
	{
	    tree[k].minn.num+=d,tree[k].lazy+=d;
	    return;
	}
	spread(k);
	int mid=(tree[k].l+tree[k].r)>>1;
	if (r<=mid) add(k<<1,l,r,d);
	else if (l>=mid+1) add(k<<1|1,l,r,d);
	else add(k<<1,l,mid,d),add(k<<1|1,mid+1,r,d);
	push_up(k);
	return;
    }
    void add2(int k,int l,int r,int d)
    {
	if (tree[k].l==l&&tree[k].r==r)
	{
	    tree[k].minn.data+=1ll*tree[k].minn.cnt*d,tree[k].lazy2+=d;
	    return;
	}
	spread(k);
	int mid=(tree[k].l+tree[k].r)>>1;
	if (r<=mid) add2(k<<1,l,r,d);
	else if (l>=mid+1) add2(k<<1|1,l,r,d);
	else add2(k<<1,l,mid,d),add2(k<<1|1,mid+1,r,d);
	push_up(k);
	return;
    }
};
seg T;
int main()
{
    int x,y,x2,y2;
    n=read(),m=read(),p[1]=n,T.build(1,1,n-1);
    for (int i=1;i<=n-1;++i) X[i]=read(),Y[i]=read();
    for (int i=1;i<=n-1;++i) a[i]=read(),p[a[i]]=i;
    for (int i=1;i<=n-1;++i) T.add(1,1,min(p[X[i]],p[Y[i]])-1,-1),T.add2(1,min(p[X[i]],p[Y[i]]),max(p[X[i]],p[Y[i]])-1,1);
    printf("%lld\n",T.tree[1].minn.data);
    while (m--)
    {
	x=read(),y=read(),x2=read(),y2=read();
	T.add(1,1,min(p[x],p[y])-1,1),T.add2(1,min(p[x],p[y]),max(p[x],p[y])-1,-1);
	T.add(1,1,min(p[x2],p[y2])-1,-1),T.add2(1,min(p[x2],p[y2]),max(p[x2],p[y2])-1,1);
	printf("%lld\n",T.tree[1].minn.data);
    }
    return 0;
}