#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

class UF {
	public:
	static const int ufmax=100052;
	int ufpar[ufmax],ufrank[ufmax],ufcnt[ufmax];
	UF() { init();}
	void init(){int i; rep(i,ufmax) { ufpar[i]=i; ufrank[i]=0; ufcnt[i]=1; } }
	int find(int x) {	return (ufpar[x]==x)?(x):(ufpar[x] = find(ufpar[x]));}
	int operator[](int x) {return find(x);}
	int count(int x) {return ufcnt[find(x)];}
	void unite(int x,int y) {
		x = find(x); y = find(y);
		if(x==y) return;
		if(ufrank[x]<ufrank[y]) ufpar[x]=y, ufcnt[y]+=ufcnt[x];
		else {ufpar[y]=x; ufcnt[x]+=ufcnt[y]; if(ufrank[x]==ufrank[y]) ufrank[x]++;}
	}
};

vvint vv;
vint used;
vint used2;

bool dfs(int x, int pre=-1, int ev=1){
	if(used[x]==0){
		used[x] = ev;
	}
	else{
		if(used[x]!=ev){
			return true;
		}
		return false;
	}
	bool ret = false;
	for(cauto y: vv[x]){
		if(y==pre) continue;
		ret |= dfs(y, x, 3^ev);
	}
	return ret;
}

void dfs2(int x, int pre=-1){
	if(used2[x]) return;
	used2[x] = 1;
	for(cauto y: vv[x]){
		if(y == pre) continue;
		dfs2(y, x);
	}
}


void mainmain(){
	ll n,m;
	cin>>n>>m;
	vv = vvint(n);
	UF uf;
	rep(i,m){
		int a,b;
		cin>>a>>b;
		a--,b--;
		uf.unite(a,b);
		vv[a].PB(b);
		vv[b].PB(a);
	}
	vll a(3);
	used=vint(n);
	used2=vint(n);
	rep(i,n){
		if(used2[i]) continue;
		dfs2(i);
		if(uf.count(i)==1){
			a[0]++;
		}
		else{
			if(dfs(i)){
				a[2]++;
			}
			else{
				a[1]++;
			}
		}
	}
	ll ans = 0;
	// cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
	ans += a[0] * (2*n-a[0]);
	// cout<<ans<<endl;
	ans += a[1] * a[1] * 2;
	ans += a[2] * a[2];
	ans += 2 * a[1] * a[2];
	cout<<ans<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 12416