#include<bits/stdc++.h>

using namespace std;

constexpr int MX = 100005;
int rnk[MX];
int w_diff[MX];
int root[MX];

int find(int x){
  if (x == root[x]) return x;
  int r = find(root[x]);
  w_diff[x] += w_diff[root[x]];
  return root[x] = r;
}

int weight(int x){
    find(x);
    return w_diff[x];
}

int diff(int x, int y){
    return weight(y) - weight(x);
}

void merge(int x, int y, int w){
    
    w += weight(x);
    w -= weight(y);

    x = find(x);
    y = find(y);
    
    if (x == y) return;
    
    if(rnk[x] < rnk[y]) swap(x, y),  w = -w;
    if(rnk[x] == rnk[y]) ++rnk[x];
    root[y] = x;
    w_diff[y] = w;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n, q;
    cin >> n >> q;
    
    for(int i=0; i<MX; i++) {
        rnk[i]=0;
        w_diff[i]=0;
        root[i]=i;
    }
 
    for(int i=0; i<q; i++){
        int c, x, y, z;
        cin >> c;
        if(c == 0){
            cin >> x >> y >> z;
            merge(x, y, z);
        }else if (c == 1){
            cin >> x >> y;
            if (find(x) != find(y)){
                cout << "?" << endl;
            }else{
                cout << diff(x, y) << endl;   
            }
        }
    }
    return 0;
}
