#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,ll>
#define fi first
#define in inline
#define se second
#define mp make_pair
#define pb push_back
#define db double
mt19937 rd(std::chrono::steady_clock::now().time_since_epoch().count());
const int N = 5e5+10;
const ll inf = 1e18,mod = 998244353;


ll read(){
	ll x = 0,f = 1;char c = getchar();
	for(;c < '0' || c > '9';c = getchar())if(c == '-')f = -1;
	for(;c >= '0' && c <= '9';c = getchar())x = (x<<1) + (x<<3) + c-'0';
	return x * f;
}
void cmax(ll &x,ll y){x = max(x,y);}
void cmin(ll &x,ll y){x = min(x,y);}


int n,m;
int a[N],x[N],y[N],t[N];

struct segment{
#define mid (l + r >> 1)
	struct tag{
		ll add,adds;
		tag operator + (const tag x)const{return {add + x.add,adds + x.adds};}
	}t[N<<2];
	struct dat{
		ll mi,cn,sum;
		dat operator + (const dat x)const{
			if(mi < x.mi)return {mi,cn,sum};
			if(mi > x.mi)return x;
			return {mi,cn + x.cn,sum + x.sum};
		}
		dat operator + (const tag x)const{return {mi + x.add,cn,sum + cn * x.adds};}
	}s[N<<2];
	void pushup(int p){s[p] = s[p<<1] + s[p<<1|1];}
	void update(int p,tag k){s[p] = s[p] + k,t[p] = t[p] + k;}
	void pushdown(int p){
		update(p<<1,t[p]),update(p<<1|1,t[p]);
		t[p] = {0,0};
	}
	void build(int p,int l,int r){
		if(l == r)return s[p] = {n - l,1,l},void();
		build(p<<1,l,mid),build(p<<1|1,mid+1,r);
		pushup(p);
	}
	void modify(int p,int l,int r,int L,int R,tag k){
		if(L > R)return;
		if(L <= l && r <= R)return update(p,k),void();
		pushdown(p);
		if(L <= mid)modify(p<<1,l,mid,L,R,k);
		if(R > mid)modify(p<<1|1,mid+1,r,L,R,k);
		pushup(p);
	}
	ll ask(int p,int l,int r,int L,int R){
		if(L <= l && r <= R)return (s[p].mi == 1) * s[p].sum;
		if(L > r || R < l)return 0;
		pushdown(p);
		return ask(p<<1,l,mid,L,R) + ask(p<<1|1,mid+1,r,L,R);
	}
}tr;


void add(int x,int y,int val){
	tr.modify(1,1,n - 1,1,min(t[x],t[y]) - 1,{val,0});
	tr.modify(1,1,n - 1,max(t[x],t[y]),n - 1,{0,val});
}

int main(){
	n = read(),m = read();
	for(int i = 1;i < n;i++)x[i] = read(),y[i] = read();
	t[1] = n;
	for(int i = 1;i < n;i++)a[i] = read(),t[a[i]] = i;
	tr.build(1,1,n - 1);
	for(int i = 1;i < n;i++)add(x[i],y[i],-1);
	printf("%lld\n",tr.ask(1,1,n - 1,1,n - 1));
	for(int i = 1;i <= m;i++){
		int x = read(),y = read();
		add(x,y,1);
		x = read(),y = read();
		add(x,y,-1);
		printf("%lld\n",tr.ask(1,1,n - 1,1,n - 1));
	}
	

	return 0;

}