3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2.1e5;
int n;
struct edge_t {
  int dest;
  int cost;
  operator int() const { return dest; }
};
vector<edge_t> adj[MAXN];
int weight[MAXN];
int ans_idx = -1;
double ans_val;
bool alive[MAXN];
int sz[MAXN];
void get_sz(int v, int p) {
  sz[v] = 1;
  for (int w : adj[v]) {
    if (!alive[w] || w == p) continue;
    get_sz(w, v);
    sz[v] += sz[w];
  }
}
int get_centroid(int v, int p, int tot_sz) {
  for (int w : adj[v]) {
    if (!alive[w] || w == p) continue;
    if (sz[w] * 2 >= tot_sz) {
      return get_centroid(w, v, tot_sz);
    }
  }
  return v;
}
void dfs(int v, int p, int d, double& dist, double& diff) {
  dist += d * sqrt(d) * weight[v];
  diff += sqrt(d) * weight[v];
  for (auto e : adj[v]) {
    if (e == p) continue;
    dfs(e, v, d + e.cost, dist, diff);
  }
}
void solve(int v) {
  get_sz(v, -1);
  v = get_centroid(v, -1, sz[v]);
  alive[v] = false;
  double cnd = 0;
  double tgt = -1;
  double maxd = -1;
  for (auto e : adj[v]) {
    double dist = 0, diff = 0;
    dfs(e, v, e.cost, dist, diff);
    cnd += dist;
    if (!alive[e]) continue;
    if (maxd < diff) {
      maxd = diff;
      tgt = e;
    }
  }
  if (ans_idx == -1 || cnd < ans_val) {
    ans_val = cnd;
    ans_idx = v;
  }
  if (tgt != -1) {
    solve(tgt);
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cout << fixed << setprecision(20);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> weight[i];
  for (int i = 0; i < n - 1; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    adj[a].push_back({b, c});
    adj[b].push_back({a, c});
  }
  for (int i = 0; i < n; i++) alive[i] = true;
  solve(0);
  cout << ans_idx + 1 << ' ' << ans_val << '\n';
  return 0;
}
