#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)

class Potential_Union_Find{
  vector<int> par; vector<int> rank; vector<int> diff_weight;
public:
  Potential_Union_Find(int n) {
    par.assign(n,0); rank.assign(n,0); diff_weight.assign(n,0);
    rep(i,n) par[i] = i;
  }
  int find(int x) {
    if(par[x] == x) {
      return x;
    } else {
      int r = find(par[x]);
      diff_weight[x] += diff_weight[par[x]];
      return par[x] = r;
    }
  }
  int weight(int x){
    find(x);
    return diff_weight[x];
  }
  void unite(int x, int y, int w){
    w += weight(x); w -= weight(y);
    x = find(x); y = find(y);
    if(x == y) return;
    if(rank[x] < rank[y]) swap(x,y), w = -w;
    if(rank[x] == rank[y]) rank[x]++;
    par[y] = x;
    diff_weight[y] = w;
  }
  bool same(int x, int y){
    return find(x) == find(y);
  }
  int diff(int x, int y){
    return weight(y) - weight(x);
  }
};

int main() {
  int n, q;
  cin >> n >> q;
  Potential_Union_Find puf(n);
  rep(i,q) {
    int t;
    cin >> t;
    if(t == 0) {
      int x, y, z;
      cin >> x >> y >> z;
      puf.unite(x,y,z);
    } else {
      int x, y;
      cin >> x >> y;
      if(puf.same(x,y)) cout << puf.diff(x,y) << endl;
      else cout << "?" << endl;
    }
  }
  return 0;
}
