#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
#define ALL(A) (A).begin(), (A).end()
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class S, class T> inline void chmax(S &a, T b){if(a < b) a = b;}
template <class S, class T> inline void chmin(S &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~






int main(void){
    int n, m; scanf("%d%d", &n, &m);
    Vint Should(n, -1);
    Wint Edge(n, Vint(0));
    REP(i, m){
        int u, v; scanf("%d%d", &u, &v); u--; v--;
        Edge[u].emplace_back(v);
        Edge[v].emplace_back(u);
    }
    /* (p1, q1)と (p2, q2)が連結である
        <=> 元グラフにおいて p1-p2, q1-q2が連結 かつ, 偶奇の等しいパスが存在
    */
    int tops = 0, nonSoles = 0, odd_even_Bob = 0;
    REP(i, n) if(Should[i] == -1){
        Should[i] = 0;
        if(Edge[i].size() != 0){
            bool freeChange = false;
            int cnt = 0;
            std::queue<int> nxt; nxt.push(i);
            while(not nxt.empty()){
                int k = nxt.front(); nxt.pop();
                vREP(ele, Edge[k]){
                    // まだ訪れていない
                    if(Should[ele] == -1){
                        Should[ele] = 1 - Should[k];
                        nxt.push(ele);
                    }
                    // 訪れたが, 偶奇を好きに切り替えられる場合
                    else if(Should[ele] == Should[k]) freeChange = true;
                }
                cnt++;
            }
            tops++; if(not freeChange) odd_even_Bob++;
            nonSoles += cnt;
        }
    }
    lli T = tops; T *= tops;
    lli OE = odd_even_Bob; OE *= odd_even_Bob;
    lli NS = nonSoles; NS *= nonSoles;
    lli res = n; res *= n; res -= NS; res += T; res += OE;
    printf("%lld\n", res);
    return 0;
}

Measured memory_bytes: 7296