// Author: lycc
// 
// Problem: P8990 [北大集训 2021] 小明的树
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P8990
// Memory Limit: 512 MB
// Time Limit: 3000 ms

#include <bits/stdc++.h>
#define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i ++)
#define rep(i, x, y) for (int i = (x); i >= (y); i --)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)((v).size())
#define ull unsigned long long
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector< int >
#define mem(v, x) memset(v, x, sizeof(v))
#define A3 array< int, 3 >
#define A4 array< int, 4 >
#define vpii vector< pair< int, int > >
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
    int v = 1; x %= p;
    while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
    return (v % p + p) % p;
}
void file() {
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
	return;
}
bool MemoryST;
const int N = 5e5 + 5;
const int mod = 998244353;
const long long INF = 1e18;
const int base = 13131;
using ll = long long;
int n, m, a[N];
struct node {
	int minn, sum, cnt;
} t[N * 4];
node operator + (node i, node j) {
	node res; res.minn = min(i.minn, j.minn); 
	res.sum = res.cnt = 0;
	if (res.minn == i.minn) res.sum = i.sum, res.cnt = i.cnt;
	if (res.minn == j.minn) res.sum += j.sum, res.cnt += j.cnt;
	return res;
}
struct Tag {
	int tag1, tag2;
} tag[N * 4];
node operator + (node i, Tag j) {
	node res; res.cnt = i.cnt;
	res.minn = i.minn + j.tag1;
	res.sum = i.sum + res.cnt * j.tag2;
	return res;
}
Tag operator + (Tag i, Tag j) {
	Tag res; res.tag1 = i.tag1 + j.tag1;
	res.tag2 = i.tag2 + j.tag2;
	return res;
}
void pushdown(int p) {
	t[ls] = t[ls] + tag[p];
	t[rs] = t[rs] + tag[p];
	tag[ls] = tag[ls] + tag[p];
	tag[rs] = tag[rs] + tag[p];
	tag[p] = Tag{0, 0};
	return;
}
void build(int l, int r, int p) {
	if (l == r) return t[p].minn = n - l, t[p].cnt = 1, void();
	int mid = (l + r) >> 1;
	build(l, mid, ls); build(mid + 1, r, rs);
	t[p] = t[ls] + t[rs];
	return;
}
void modify(int l, int r, int x, int y, int p, Tag v) {
	if (x > y) return;
	if (l >= x && r <= y) return t[p] = t[p] + v, tag[p] = tag[p] + v, void();
	int mid = (l + r) >> 1; pushdown(p);
	if (x <= mid) modify(l, mid, x, y, ls, v);
	if (y > mid) modify(mid + 1, r, x, y, rs, v);
	t[p] = t[ls] + t[rs];
	return;
}
void add(int x, int y) {
	modify(1, n - 1, min(a[x], a[y]), max(a[x], a[y]) - 1, 1, Tag{0, 1});
	modify(1, n - 1, 1, min(a[x], a[y]) - 1, 1, Tag{-1, 0});
	return;
}
void del(int x, int y) {
	modify(1, n - 1, min(a[x], a[y]), max(a[x], a[y]) - 1, 1, Tag{0, -1});
	modify(1, n - 1, 1, min(a[x], a[y]) - 1, 1, Tag{1, 0});	
	return;
}
void Main() {
	cin >> n >> m; vpii e; a[1] = n;
	For (i, 1, n - 1) {
		int x, y; cin >> x >> y;
		e.pb(x, y);
	}
	For (i, 1, n - 1) {
		int x; cin >> x;
		a[x] = i;
	}
	build(1, n - 1, 1);
	for (auto [x, y] : e) add(x, y);
	if (t[1].minn == 1) cout << t[1].sum << '\n';
	else cout << "0\n";
	while (m --) {
		int x, y; cin >> x >> y;
		del(x, y);
		cin >> x >> y;
		add(x, y);
		if (t[1].minn == 1) cout << t[1].sum << '\n';
		else cout << "0\n";
	}
    return;
}
bool MemoryED;
signed main() {
	// file();
    ios :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
    int TESTCNT = 1;
    // cin >> TESTCNT;
    while (TESTCNT --) Main();
    cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms"; 
    return 0;
}