#line 1 "graph_tree/test/LC_centroid_decomposition.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/frequency_table_of_tree_distance"
#line 2 "math/FPS_base.hpp"
#include<vector>
#include<tuple>
#include<iostream>
#include<cmath>
#include<type_traits>
#include<cassert>
/**
* @brief 形式的冪級数(BASE)
*/
template<typename T,typename F>
struct FPS_BASE:std::vector<T>{
using std::vector<T>::vector;
using P=FPS_BASE<T,F>;
F fft;
FPS_BASE(){}
inline P operator +(T x)const noexcept{return P(*this)+=x;}
inline P operator -(T x)const noexcept{return P(*this)-=x;}
inline P operator *(T x)const noexcept{return P(*this)*=x;}
inline P operator /(T x)const noexcept{return P(*this)/=x;}
inline P operator <<(int x)noexcept{return P(*this)<<=x;}
inline P operator >>(int x)noexcept{return P(*this)>>=x;}
inline P operator +(const P& x)const noexcept{return P(*this)+=x;}
inline P operator -(const P& x)const noexcept{return P(*this)-=x;}
inline P operator -()const noexcept{return P(1,T(0))-=P(*this);}
inline P operator *(const P& x)const noexcept{return P(*this)*=x;}
inline P operator /(const P& x)const noexcept{return P(*this)/=x;}
inline P operator %(const P& x)const noexcept{return P(*this)%=x;}
bool operator ==(P x){
for(int i=0;i<(int)max((*this).size(),x.size());++i){
if(i>=(int)(*this).size()&&x[i]!=T())return 0;
if(i>=(int)x.size()&&(*this)[i]!=T())return 0;
if(i<(int)min((*this).size(),x.size()))if((*this)[i]!=x[i])return 0;
}
return 1;
}
P &operator +=(T x){
if(this->size()==0)this->resize(1,T(0));
(*this)[0]+=x;
return (*this);
}
P &operator -=(T x){
if(this->size()==0)this->resize(1,T(0));
(*this)[0]-=x;
return (*this);
}
P &operator *=(T x){
for(int i=0;i<(int)this->size();++i){
(*this)[i]*=x;
}
return (*this);
}
P &operator /=(T x){
if(std::is_same<T,long long>::value){
for(int i=0;i<(int)this->size();++i){
(*this)[i]/=x;
}
return (*this);
}
return (*this)*=(T(1)/x);
}
P &operator <<=(int x){
P ret(x,T(0));
ret.insert(ret.end(),begin(*this),end(*this));
return (*this)=ret;
}
P &operator >>=(int x){
if((int)(*this).size()<=x)return (*this)=P();
P ret;
ret.insert(ret.end(),begin(*this)+x,end(*this));
return (*this)=ret;
}
P &operator +=(const P& x){
if(this->size()<x.size())this->resize(x.size(),T(0));
for(int i=0;i<(int)x.size();++i){
(*this)[i]+=x[i];
}
return (*this);
}
P &operator -=(const P& x){
if(this->size()<x.size())this->resize(x.size(),T(0));
for(int i=0;i<(int)x.size();++i){
(*this)[i]-=x[i];
}
return (*this);
}
P &operator *=(const P& x){
return (*this)=F()(*this,x);
}
P &operator /=(P x){
if(this->size()<x.size()) {
this->clear();
return (*this);
}
const int n=this->size()-x.size()+1;
return (*this) = (rev().pre(n)*x.rev().inv(n)).pre(n).rev(n);
}
P &operator %=(const P& x){
return ((*this)-=(*this)/x*x);
}
inline void print(){
for(int i=0;i<(int)(*this).size();++i)std::cerr<<(*this)[i]<<" \n"[i==(int)(*this).size()-1];
if((int)(*this).size()==0)std::cerr<<'\n';
}
inline P& shrink(){while((*this).back()==0)(*this).pop_back();return (*this);}
inline P pre(int sz)const{
return P(begin(*this),begin(*this)+std::min((int)this->size(),sz));
}
P rev(int deg=-1){
P ret(*this);
if(deg!=-1)ret.resize(deg,T(0));
reverse(begin(ret),end(ret));
return ret;
}
P inv(int deg=-1){
assert((*this)[0]!=T(0));
const int n=deg==-1?this->size():deg;
P ret({T(1)/(*this)[0]});
for(int i=1;i<n;i<<=1){
ret*=(-ret*pre(i<<1)+2).pre(i<<1);
}
return ret.pre(n);
}
inline P dot(const P& x){
P ret(*this);
for(int i=0;i<int(min(this->size(),x.size()));++i){
ret[i]*=x[i];
}
return ret;
}
P diff(){
if((int)(*this).size()<=1)return P();
P ret(*this);
for(int i=0;i<(int)ret.size();i++){
ret[i]*=i;
}
return ret>>1;
}
P integral(){
P ret(*this);
for(int i=0;i<(int)ret.size();i++){
ret[i]/=i+1;
}
return ret<<1;
}
P log(int deg=-1){
assert((*this)[0]==T(1));
const int n=deg==-1?this->size():deg;
return (diff()*inv(n)).pre(n-1).integral();
}
P exp(int deg=-1){
assert((*this)[0]==T(0));
const int n=deg==-1?this->size():deg;
P ret({T(1)});
for(int i=1;i<n;i<<=1){
ret=ret*(pre(i<<1)+1-ret.log(i<<1)).pre(i<<1);
}
return ret.pre(n);
}
P pow(int c,int deg=-1){
const int n=deg==-1?this->size():deg;
long long i=0;
P ret(*static_cast<P*>(this));
while(i!=(int)this->size()&&ret[i]==0)i++;
if(i==(int)this->size())return P(n,0);
if(i*c>=n)return P(n,0);
T k=ret[i];
return ((((ret>>i)/k).log()*c).exp()*(k.pow(c))<<(i*c)).pre(n);
// const int n=deg==-1?this->size():deg;
// long long i=0;
// P ret(*this);
// while(i!=(int)this->size()&&ret[i]==0)i++;
// if(i==(int)this->size())return P(n,0);
// if(i*c>=n)return P(n,0);
// T k=ret[i];
// return ((((ret>>i)/k).log()*c).exp()*(k.pow(c))<<(i*c)).pre(n);
// P x(*this);
// P ret(1,1);
// while(c) {
// if(c&1){
// ret*=x;
// if(~deg)ret=ret.pre(deg);
// }
// x*=x;
// if(~deg)x=x.pre(deg);
// c>>=1;
// }
// return ret;
}
P sqrt(int deg=-1){
const int n=deg==-1?this->size():deg;
if((*this)[0]==T(0)) {
for(int i=1;i<(int)this->size();i++) {
if((*this)[i]!=T(0)) {
if(i&1)return{};
if(n-i/2<=0)break;
auto ret=(*this>>i).sqrt(n-i/2)<<(i/2);
if((int)ret.size()<n)ret.resize(n,T(0));
return ret;
}
}
return P(n,0);
}
P ret({T(1)});
for(int i=1;i<n;i<<=1){
ret=(ret+pre(i<<1)*ret.inv(i<<1)).pre(i<<1)/T(2);
}
return ret.pre(n);
}
P shift(int c){
const int n=this->size();
P f(*this),g(n,0);
for(int i=0;i<n;++i)f[i]*=F().fact(T(i));
for(int i=0;i<n;++i)g[i]=F().pow(T(c),i)/F().fact(T(i));
g=g.rev();
f*=g;
f>>=n-1;
for(int i=0;i<n;++i)f[i]/=F().fact(T(i));
return f;
}
T eval(T x){
T res=0;
for(int i=(int)this->size()-1;i>=0;--i){
res*=x;
res+=(*this)[i];
}
return res;
}
P mul(const std::vector<std::pair<int,T>>& x){
int mx=0;
for(auto [s,t]:x){
if(mx<s)mx=s;
}
P res((int)this->size()+mx);
for(int i=0;i<(int)this->size();++i){
for(auto [s,t]:x){
res[i+s]+=(*this)[i]*t;
}
}
return res;
}
P div(const std::vector<std::pair<int,T>>& x){
P res(*this);
T cnt=0;
for(auto [s,t]:x){
if(s==0)cnt+=t;
}
cnt=cnt.inv();
for(int i=0;i<(int)this->size();++i){
for(auto [s,t]:x){
if(s==0)continue;
if(i>=s)res[i]-=res[i-s]*t*cnt;
}
}
res*=cnt;
return res;
}
static P interpolation(const std::vector<T>&x,const std::vector<T>& y){
const int n=x.size();
std::vector<std::pair<P,P>>a(n*2-1);
std::vector<P> b(n*2-1);
for(int i=0;i<n;++i)a[i+n-1]=std::make_pair(P{1},P{T()-x[i],1});
for(int i=n-2;i>=0;--i)a[i]={a[2*i+1].first*a[2*i+2].second+a[2*i+2].first*a[2*i+1].second,a[2*i+1].second*a[2*i+2].second};
auto d=(a[0].first).multipoint_eval(x);
for(int i=0;i<n;++i)b[i+n-1]=P{T(y[i]/d[i])};
for(int i=n-2;i>=0;--i)b[i]=b[2*i+1]*a[2*i+2].second+b[2*i+2]*a[2*i+1].second;
return b[0];
}
static P interpolation(const std::vector<T>& y){
const int n=y.size();
std::vector<std::pair<P,P>>a(n*2-1);
std::vector<P>b(n*2-1);
for(int i=0;i<n;++i)a[i+n-1]=std::make_pair(P{1},P{T()-i,1});
for(int i=n-2;i>=0;--i)a[i]={a[2*i+1].first*a[2*i+2].second+a[2*i+2].first*a[2*i+1].second,a[2*i+1].second*a[2*i+2].second};
for(int i=0;i<n;++i){
T tmp=F().fact(T(i))*F().pow(T(-1),i)*F().fact(T(n-1-i));
b[i+n-1]=P{T(y[i]/tmp)};
}
for(int i=n-2;i>=0;--i)b[i]=b[2*i+1]*a[2*i+2].second+b[2*i+2]*a[2*i+1].second;
return b[0];
}
std::vector<T> multipoint_eval(const std::vector<T>&x){
const int n=x.size();
P* v=new P[2*n-1];
for(int i=0;i<n;i++)v[i+n-1]={T()-x[i],T(1)};
for(int i=n-2;i>=0;i--){v[i]=v[i*2+1]*v[i*2+2];}
v[0]=P(*this)%v[0];v[0].shrink();
for(int i=1;i<n*2-1;i++){
v[i]=v[(i-1)/2]%v[i];
v[i].shrink();
}
std::vector<T>res(n);
for(int i=0;i<n;i++)res[i]=v[i+n-1][0];
return res;
}
P slice(int s,int e,int k){
P res;
for(int i=s;i<e;i+=k)res.push_back((*this)[i]);
return res;
}
T nth_term(P q,int64_t x){
if(x==0)return (*this)[0]/q[0];
P p(*this);
P q2=q;
for(int i=1;i<(int)q2.size();i+=2)q2[i]*=-1;
q*=q2;
p*=q2;
return p.slice(x%2,p.size(),2).nth_term(q.slice(0,q.size(),2),x/2);
}
P gcd(P q){
return *this==P()?q:(q%(*this).shrink()).gcd(*this);
}
//(*this)(t(x))
P manipulate(P t,int deg){
P s=P(*this);
if(deg==0)return P();
if((int)t.size()==1)return P{s.eval(t[0])};
int k=std::min((int)::sqrt(deg/(::log2(deg)+1))+1,(int)t.size());
int b=deg/k+1;
P t2=t.pre(k);
std::vector<P>table(s.size()/2+1,P{1});
for(int i=1;i<(int)table.size();i++){
table[i]=((table[i-1])*t2).pre(deg);
}
auto f=[&](auto f,auto l,auto r,int deg)->P{
if(r-l==1)return P{*l};
auto m=l+(r-l)/2;
return f(f,l,m,deg)+(table[m-l]*f(f,m,r,deg)).pre(deg);
};
P ans=P();
P tmp=f(f,s.begin(),s.end(),deg);
P tmp2=P{1};
T tmp3=T(1);
int tmp5=-1;
P tmp6=t2.diff();
if(tmp6==P()){
for(int i=0;i<b;++i){
if(tmp.size()==0)break;
ans+=(tmp2*tmp[0]).pre(deg)/tmp3;
tmp=tmp.diff();
tmp2=(tmp2*(t-t2)).pre(deg);
tmp3*=T(i+1);
}
}else{
while(t2[++tmp5]==T());
P tmp4=(tmp6>>(tmp5-1)).inv(deg);
for(int i=0;i<b;++i){
ans+=(tmp*tmp2).pre(deg)/tmp3;
tmp=((tmp.diff()>>(tmp5-1))*tmp4).pre(deg);
tmp2=(tmp2*(t-t2)).pre(deg);
tmp3*=T(i+1);
}
}
return ans;
}
//(*this)(t(x))
P manipulate2(P t,int deg){
P ans=P();
P s=(*this).rev();
for(int i=0;i<(int)s.size();++i){
ans=(ans*t+s[i]).pre(deg);
}
return ans;
}
P find_linear_recurrence()const{
const int n=this->size();
P b={T(-1)},c={T(-1)};
T y=T(1);
for(int i=1;i<=n;++i){
int l=c.size(),m=b.size();
T x=0;
for(int j=0;j<l;++j)x+=c[j]*(*this)[i-l+j];
b.emplace_back(0);
m++;
if(x==T(0))continue;
T freq=x/y;
if(l<m){
auto tmp=c;
c<<=m-l;
c-=b*freq;
b=tmp;
y=x;
}else{
c-=(b*freq)<<(l-m);
}
}
return c;
}
static P stirling_second(int n){
P a(n+1,0),b(n+1,0);
for(int i=0;i<=n;++i){
a[i]=F().pow(T(i),n)/F().fact(T(i));
b[i]=(i%2?T(-1):T(1))/F().fact(T(i));
}
return (a*b).pre(n+1);
}
void debug(){
for(int i=0;i<(int)(*this).size();++i)std::cerr<<(*this)[i]<<" \n"[i==(int)(*this).size()-1];
}
};
#line 3 "math/FPS_mint.hpp"
#include<atcoder/convolution.hpp>
#line 1 "math/ceil_pow2.hpp"
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
#line 1 "math/mod_pow.hpp"
/**
* @brief (x^y)%mod
*/
long long mod_pow(long long x,long long y,long long mod){
long long ret=1;
while(y>0) {
if(y&1)(ret*=x)%=mod;
(x*=x)%=mod;
y>>=1;
}
return ret;
}
#line 4 "math/garner.hpp"
/**
*
* @brief ガーナーのアルゴリズム
*
*/
long long garner(const std::vector<long long>&a,const std::vector<long long>&mods){
const int sz=a.size();
long long coeffs[sz+1]={1,1,1,1};
long long constants[sz+1]={};
for(int i=0;i<sz;i++){
long long v=(mods[i]+a[i]-constants[i])%mods[i]*mod_pow(coeffs[i],mods[i]-2,mods[i])%mods[i];
for(int j=i+1;j<sz+1;j++) {
constants[j]=(constants[j]+coeffs[j]*v)%mods[j];
coeffs[j]=(coeffs[j]*mods[i])%mods[j];
}
}
return constants[sz];
}
#line 6 "math/FPS_mint.hpp"
/**
* @brief 形式的冪級数(ModInt)
*/
template<typename Mint>
struct _FPS{
template<typename T>
T operator()(const T& _s,const T& _t){
if(_s.size()==0||_t.size()==0)return T();
const size_t sz=_s.size()+_t.size()-1;
if((Mint::get_mod()&((1<<ceil_pow2(sz))-1))==1){
std::vector<atcoder::static_modint<Mint::get_mod()>>s(_s.size()),t(_t.size());
for(size_t i=0;i<_s.size();++i)s[i]=_s[i].value();
for(size_t i=0;i<_t.size();++i)t[i]=_t[i].value();
std::vector<atcoder::static_modint<Mint::get_mod()>> _v=atcoder::convolution(s,t);
T v(_v.size());
for (size_t i=0;i<_v.size();++i)v[i]=_v[i].val();
return v;
}else{
std::vector<atcoder::static_modint<1224736769>>s1(_s.size()),t1(_t.size());
std::vector<atcoder::static_modint<1045430273>>s2(_s.size()),t2(_t.size());
std::vector<atcoder::static_modint<1007681537>>s3(_s.size()),t3(_t.size());
for(size_t i=0;i<_s.size();++i){
s1[i]=_s[i].value();
s2[i]=_s[i].value();
s3[i]=_s[i].value();
}
for(size_t i=0;i<_t.size();++i){
t1[i]=_t[i].value();
t2[i]=_t[i].value();
t3[i]=_t[i].value();
}
auto v1=atcoder::convolution(s1,t1);
auto v2=atcoder::convolution(s2,t2);
auto v3=atcoder::convolution(s3,t3);
T v(sz);
for(size_t i=0;i<sz;++i){
v[i]=garner(std::vector<long long>{v1[i].val(),v2[i].val(),v3[i].val()},std::vector<long long>{1224736769,1045430273,1007681537,(long long)Mint::get_mod()});
}
return v;
}
}
template<typename T>
T fact(const T& s){
return s.fact();
}
template<typename T>
T pow(const T& s,long long i){
return s.pow(i);
}
};
template<typename Mint>using fps=FPS_BASE<Mint,_FPS<Mint>>;
#line 5 "graph_tree/graph_template.hpp"
/**
* @brief グラフテンプレート
*/
using graph=std::vector<std::vector<int>>;
template<typename T>
using graph_w=std::vector<std::vector<std::pair<int,T>>>;
graph load_graph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_digraph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);}return g;}
graph load_graph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_digraph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);}return g;}
graph load_tree(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_tree0(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;}
graph load_treep(int n){graph g(n);for(int i=0;i<n-1;++i){int t;std::cin>>t;g[i+1].push_back(t);g[t].push_back(i+1);}return g;}
template<typename T>graph_w<T> load_graph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_digraph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);}return g;}
template<typename T>graph_w<T> load_graph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_digraph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);}return g;}
template<typename T>graph_w<T> load_tree_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_tree0_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;}
template<typename T>graph_w<T> load_treep_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int t;T u;std::cin>>t>>u;g[i+1].emplace_back(t,u);g[t].emplace_back(i+1,u);}return g;}
#line 4 "graph_tree/centroid_decomposition.hpp"
/**
* @brief 重心分解
*/
class centroid_decomposition{
graph g;
std::vector<int>used;
std::vector<int>v;
graph ch;
int s;
int dfs(int n,int p,int sz,int root){
if(used[n])return 0;
bool b=1;
int res=1;
for(auto e:g[n]){
if(p==e)continue;
auto t=dfs(e,n,sz,root);
res+=t;
if(t>sz/2)b=0;
}
if(!b||sz-res>sz/2)return res;
if(root!=-1)ch[root].push_back(n);
else s=n;
v.push_back(n);
used[n]=1;
for(auto e:g[n]){
dfs(e,n,dfs(e,n,g.size()*2,n),n);
}
return g.size()*2;
}
public:
centroid_decomposition(const graph&g):g(g){
int n=g.size();
used.resize(n);
ch.resize(n);
dfs(0,-1,n,-1);
}
int get_root(){return s;}
std::vector<int> operator[](int i){return ch[i];}
std::vector<int> get_euler_tour(){return v;}
};
#line 2 "util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)
// #define rep(i,...) for(auto i:range(__VA_ARGS__))
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#line 5 "math/mod_int.hpp"
/**
* @brief ModInt
*/
template<int MOD>
struct mod_int {
using mint=mod_int<MOD>;
using u64 = std::uint_fast64_t;
u64 a;
constexpr mod_int(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){}
constexpr u64 &value()noexcept{return a;}
constexpr const u64 &value() const noexcept {return a;}
constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
constexpr mint &operator+=(const mint rhs) noexcept {
a += rhs.a;
if (a >= get_mod())a -= get_mod();
return *this;
}
constexpr mint &operator-=(const mint rhs) noexcept {
if (a<rhs.a)a += get_mod();
a -= rhs.a;
return *this;
}
constexpr mint &operator*=(const mint rhs) noexcept {
a = a * rhs.a % get_mod();
return *this;
}
constexpr mint operator++(int) noexcept {
a += 1;
if (a >= get_mod())a -= get_mod();
return *this;
}
constexpr mint operator--(int) noexcept {
if (a<1)a += get_mod();
a -= 1;
return *this;
}
constexpr mint &operator/=(mint rhs) noexcept {
u64 exp=get_mod()-2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(mint x) noexcept {
return a==x.a;
}
constexpr bool operator!=(mint x) noexcept {
return a!=x.a;
}
constexpr bool operator<(mint x) noexcept {
return a<x.a;
}
constexpr bool operator>(mint x) noexcept {
return a>x.a;
}
constexpr bool operator<=(mint x) noexcept {
return a<=x.a;
}
constexpr bool operator>=(mint x) noexcept {
return a>=x.a;
}
constexpr static int root(){
mint root = 2;
while(root.pow((get_mod()-1)>>1).a==1)root++;
return root.a;
}
constexpr mint pow(long long n)const{
long long x=a;
mint ret = 1;
while(n>0) {
if(n&1)(ret*=x);
(x*=x)%=get_mod();
n>>=1;
}
return ret;
}
constexpr mint inv(){
return pow(get_mod()-2);
}
static std::vector<mint> fac;
static std::vector<mint> ifac;
static bool init;
constexpr static int mx=10000001;
void build()const{
init=0;
fac.resize(mx);
ifac.resize(mx);
fac[0]=1,ifac[0]=1;
for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i;
ifac[mx-1]=fac[mx-1].inv();
for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1);
}
mint comb(long long b){
if(init)build();
if(a<0||b<0)return 0;
if(a==0&&b==0)return 1;
if((long long)a<b)return 0;
return fac[a]*ifac[a-b]*ifac[b];
}
mint fact()const{
if(init)build();
return fac[a];
}
mint fact_inv()const{
if(init)build();
return ifac[a];
}
friend std::ostream& operator<<(std::ostream& lhs, const mint& rhs) noexcept {
lhs << rhs.a;
return lhs;
}
friend std::istream& operator>>(std::istream& lhs,mint& rhs) noexcept {
lhs >> rhs.a;
return lhs;
}
constexpr static bool is_static=true;
constexpr static u64 get_mod(){
return MOD;
}
};
template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::fac;
template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::ifac;
template<int MOD>bool mod_int<MOD>::init=1;
#line 8 "graph_tree/test/LC_centroid_decomposition.test.cpp"
template<int MOD>
fps<mod_int<MOD>> solve(int n,const graph&g,const vector<int>&d){
using fps=fps<mod_int<MOD>>;
fps ans;
std::bitset<200000>used;
rep(i,n){
fps s{1};
used[d[i]]=1;
for(auto e:g[d[i]]){
fps v{0};
auto f=[&](auto f,lint n,lint p,lint cnt){
if(used[n])return;
if((int)v.size()==cnt)v.resize(v.size()*2);
if((int)s.size()==cnt)s.resize(s.size()*2);
v[cnt]++;
s[cnt]++;
for(auto e:g[n]){
if(p==e)continue;
f(f,e,n,cnt+1);
}
};
f(f,e,-1,1);
ans-=v*v;
}
ans+=s*s;
}
ans>>=1;
ans/=2;
ans.resize(n-1,0);
return ans;
}
int main(){
int n;
cin>>n;
graph g=load_tree0(n);
centroid_decomposition cd(g);
auto d=cd.get_euler_tour();
auto s=solve<1224736769>(n,g,d);
auto t=solve<1045430273>(n,g,d);
vector<lint>ans(n-1);
for(int i=0;i<n-1;++i){
ans[i]=garner(vector<long long>{(long long)s[i].value(),(long long)t[i].value()},vector<long long>{1224736769LL,1045430273LL,1LL<<40});
}
output(ans);
}
graph_tree/test/LC_centroid_decomposition.test.cpp