#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define pi pair<ll, ll>
#define fi first
#define se second
#define N 111111
//#define fi(x) (x->first)
//#define se(x) (x->second)
vector<ll> g[N];
ll n, s, u, v, fa[N], vis[N], sz[N], val[N], sum[N], cnt, ans;
void add(int u, int v){
	g[u].push_back(v);
}
bool cmp(int u, int v){
	return sz[u] * val[v] > sz[v] * val[u];
}
ll calc(int u, int v){
	return sz[v] * val[u] - sz[u] * val[v];
}
void pre(int u, int f){
	fa[u] = f;
	sz[u] = 1;
	val[u] = u;
	for(auto v : g[u]){
		if(v == f)
			continue;
		pre(v, u);
		sz[u] += sz[v];
		val[u] += val[v];
	}
}
void dfs(int u, int f){
	if(!vis[u]){
		ans += u * (++cnt), vis[u] = true;
	}
	for(auto v : g[u]){
		if(v == f)
			continue;
		dfs(v, u);
	}
}
int main(){
	mt19937_64 gen(time(0));
	scanf("%lld%lld", &n, &s);
	for(int i = 1 ; i < n ; i++){
		scanf("%lld%lld", &u, &v);
		add(u, v);
		add(v, u);
	}
	pre(s, s);
	if(sz[1] >= n - 1){
		sort(g[1].begin(), g[1].end());
	}
	else if(n >= 18){
		for(int i = 1 ; i <= n ; i++){
			for(int j = 0 ; j < g[i].size() ; j++){
				for(int k = 1 ; k < g[i].size() ; k++)
					if(calc(g[i][k], g[i][k - 1]) <= 0)
						swap(g[i][k], g[i][k - 1]);
			}
		}
	}
	else{
		ll ans1 = 0;
		for(int k = 1 ; k <= __lg(20 * n) ; k++){
			ans = cnt = 0;
			for(int i = 1 ; i <= n ; i++){
				shuffle(g[i].begin(), g[i].end(), gen);
				sort(g[i].begin(), g[i].end(), cmp);
			}
			dfs(s, s);
			ans1 = max(ans1, ans);
		}
		printf("%lld", ans1);
		return 0;
	}
	dfs(s, s);
	printf("%lld", ans);
	return 0;
}
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);

*/