// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 500005;

int n, m, b[N], a[N], L;

PII e[N];

int mx[N << 2], c[N << 2];

LL s[N << 2];

int tg[N << 2][2];

#define ls (p << 1)
#define rs (p << 1 | 1)

void inline add(int o, int p, int k) {
	tg[p][o] += k;
	if (o == 0) mx[p] += k;
	else s[p] += c[p] * k;
}

void inline pushup(int p) {
	s[p] = 0;
	c[p] = 0;
	mx[p] = max(mx[ls], mx[rs]);
	if (mx[p] == mx[ls]) c[p] += c[ls], s[p] += s[ls];
	if (mx[p] == mx[rs]) c[p] += c[rs], s[p] += s[rs];
}

void inline pushdown(int p) {
	for (int i = 0; i < 2; i++) {
		if (tg[p][i]) {
			add(i, ls, tg[p][i]);
			add(i, rs, tg[p][i]);
			tg[p][i] = 0;
		}
	}
}

void build(int p, int l, int r) {
	if (l == r) {
		mx[p] = -(n - r - 1);
		c[p] = 1;
		return;
	}
	int mid = (l + r) >> 1;
	build(ls, l, mid);
	build(rs, mid + 1, r);
	pushup(p);
}

void chg(int p, int l, int r, int x, int y, int k, int o) {
	if (x > y) return;
	if (x <= l && r <= y) {
		add(o, p, k);
		return;
	}
	pushdown(p);
	int mid = (l + r) >> 1;
	if (x <= mid) chg(ls, l, mid, x, y, k, o);
	if (mid < y) chg(rs, mid + 1, r, x, y, k, o);
	pushup(p);
}

void inline upd(int x, int y, int k) {
	if (b[x] > b[y]) swap(x, y);
	chg(1, 1, L, 1, b[x] - 1, k, 0);
	chg(1, 1, L, b[x], b[y] - 1, k, 1);
}

void inline out() {
	LL ans = 0;
	if (mx[1] == 0) ans = s[1];
	printf("%lld\n", ans);
}

int main() {
    read(n), read(m);
    for (int i = 1; i < n; i++) read(e[i].fi), read(e[i].se);
    a[n] = 1;
    for (int i = 1; i < n; i++) read(a[i]);
    for (int i = 1; i <= n; i++) b[a[i]] = i;
    L = n - 1;	
	build(1, 1, L);
	for (int i = 1; i < n; i++) upd(e[i].fi, e[i].se, 1);
	out();
	while (m--) {
		int x1, y1, x2, y2; read(x1), read(y1), read(x2), read(y2);
		upd(x1, y1, -1);
		upd(x2, y2, 1);
		out();
	}
    return 0;
}