# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Edge{int u,v;}e[500010];
int n,a[500010],tag1[1100010],tag2[1100010];
struct node
{
	int minn,cnt;
	ll sum;
	node():cnt(0),sum(0){}
	node operator+(const node &a)const
	{
		node ans;
		ans.minn=min(minn,a.minn);
		if(minn==ans.minn) ans.cnt+=cnt,ans.sum+=sum;
		if(a.minn==ans.minn) ans.cnt+=a.cnt,ans.sum+=a.sum;
		return ans;
	}
}val[1100010];
void build(int rt,int l,int r)
{
	if(l==r) return val[rt].minn=-l,val[rt].cnt=1,void();
	int mid=(l+r)/2;
	build(rt*2,l,mid);build(rt*2+1,mid+1,r);
	val[rt]=val[rt*2]+val[rt*2+1];
}
void push1(int rt,int t){tag1[rt]+=t;val[rt].sum+=(ll)t*val[rt].cnt;}
void push2(int rt,int t){tag2[rt]+=t;val[rt].minn+=t;}
void pushdown(int rt)
{
	if(tag1[rt])
	{
		push1(rt*2,tag1[rt]);push1(rt*2+1,tag1[rt]);
		tag1[rt]=0;
	}
	if(tag2[rt])
	{
		push2(rt*2,tag2[rt]);push2(rt*2+1,tag2[rt]);
		tag2[rt]=0;
	}
}
void update1(int rt,int l,int r,int x,int y,int z)
{
	if(l>y || r<x) return;
	if(x<=l && r<=y) return push1(rt,z);
	pushdown(rt);
	int mid=(l+r)/2;
	update1(rt*2,l,mid,x,y,z);update1(rt*2+1,mid+1,r,x,y,z);
	val[rt]=val[rt*2]+val[rt*2+1];
}
void update2(int rt,int l,int r,int x,int y,int z)
{
	if(l>y || r<x) return;
	if(x<=l && r<=y) return push2(rt,z);
	pushdown(rt);
	int mid=(l+r)/2;
	update2(rt*2,l,mid,x,y,z);update2(rt*2+1,mid+1,r,x,y,z);
	val[rt]=val[rt*2]+val[rt*2+1];
}
void upd(int x,int y,int z)
{
	if(x>y) swap(x,y);
	update1(1,1,n-1,x,y-1,z);
	update2(1,1,n-1,x,n,z);
}
ll query(){return val[1].minn?0:val[1].sum;}
int main()
{
	int m,u,x1,y1,x2,y2;
	cin>>n>>m;
	for(int i=1;i<n;i++) scanf("%d%d",&e[i].u,&e[i].v);
	a[1]=n;
	for(int i=1;i<n;i++) scanf("%d",&u),a[u]=i;
	build(1,1,n-1);
	for(int i=1;i<n;i++) upd(a[e[i].u],a[e[i].v],1);
	cout<<query()<<endl;
	while(m--)
	{
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		upd(a[x1],a[y1],-1);upd(a[x2],a[y2],1);
		printf("%lld\n",query());
	}
	return 0;
}